09 2018 档案
摘要:FluorescentTime Limit: 3000/3000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 937 Accepted S...
阅读全文
摘要:In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous re...
阅读全文
摘要:Common Subexpression Elimination UVA - 12219 题目大意:给出一段表达式,并让其中的重复部分用序号来代替思路:首先针对表达式构建出表达式树,对于出现过了的子树用map储存,再在打印时用一个vis数组来记录这个序号的子树是否打...
阅读全文
摘要:Slim Span UVA - 1395 题目大意:给出m条边,问使n个节点连成一幅连通图的最大边减去最小边的最小值思路:对边按照边权排序,求出在边权从小到大的边序列中连续的可以使点连成图的边的最大值与最小值之差。再求暴力对比。AC代码:#include#includ...
阅读全文
摘要:Play on Words UVA - 10129 题意:给出一些单词,问能否让首尾字母相同的字符串相连,最后形成一个串。思路:不难看出,这是一个欧拉道路问题。简单介绍一下欧拉道路:在欧拉道路中,除了起点和终点,所有的点的入度和出度都相等。(如所有的点的入度都等于出度...
阅读全文
摘要:Legacy CodeForces - 787D Rick and his co-workers have made a new radioactive formula and a lot of bad guys are after them. So Rick wan...
阅读全文
摘要:How Many to Be Happy? Gym - 101667E 题目大意:给出一个无向图,令使得一条边e成为这个图的最小生成树的一条树边需要删去的最少的边的数量为H(e),问H(e)地总和是多少思路:对于一幅图我们构造最小生成树地时候总是先选较小的边再选择较大...
阅读全文
摘要:前两题焦作赛区的网络预选赛上,出现了一个k次覆盖区间问题。当时第一想法是线段树优化建图,但是也不会这个,所以当时就放过去了。赛后补题的时候发现这题可以通过网络流直接建模解决。首先我们来看一个例题Intervals POJ - 3680 You are given N ...
阅读全文
摘要:In a world where ordinary people cannot reach, a boy named "Koutarou" and a girl named "Sena" are playing a video game. The game syste...
阅读全文
摘要:After the long vacation, the maze designer master has to do his job. A tour company gives him a map which is a rectangle. The map cons...
阅读全文
摘要:A. Hard to prepare 题库链接 262144KAfter Incident, a feast is usually held in Hakurei Shrine. This time Reimu asked Kokoro to deliver a N...
阅读全文
摘要:Supreme Number 题库链接A prime number (or a prime) is a natural number greater than 11 that cannot be formed by multiplying two smaller...
阅读全文
摘要:F. Fantastic Graph 题库链接"Oh, There is a bipartite graph.""Make it Fantastic."X wants to check whether a bipartite graph is a fantastic...
阅读全文
摘要:D. Valid BFS?time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe BFS algorithm i...
阅读全文
摘要:1037B - Reach Mediantime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given...
阅读全文
摘要:1037A - PacketsA. Packetstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou have...
阅读全文
摘要:A square-free integer is an integer which is indivisible by any square number except 11. For example, 6 = 2 \cdot 36=2⋅3 is square-fre...
阅读全文

浙公网安备 33010602011771号