随笔分类 - 并查集
摘要:tree Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 863 Accepted Submission(s): 409 Problem Desc
阅读全文
摘要:合纵连横时间限制:1000ms | 内存限制:65535KB难度:3描述乱世天下,诸侯割据。每个诸侯王都有一片自己的领土。但是不是所有的诸侯王都是安分守己的,实力强大的诸侯国会设法吞并那些实力弱的,让自己的领土面积不断扩大。而实力弱的诸侯王为了不让自己的领土被吞并,他会联合一些其他同样弱小的诸侯国,...
阅读全文
摘要:Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7515Accepted Submission(s): 2368P...
阅读全文
摘要:FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:30427Accepted:9806DescriptionFreddy Frog is sitting on a stone in the middle of a lake. S...
阅读全文
摘要:Dragon BallsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4384Accepted Submission(s): 1673Proble...
阅读全文
摘要:The SuspectsTime Limit:1000MSMemory Limit:20000KTotal Submissions:26919Accepted:13152DescriptionSevere acute respiratory syndrome (SARS), an atypical ...
阅读全文
摘要:Fibonacci TreeTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2915Accepted Submission(s): 931Probl...
阅读全文
摘要:Connect the CitiesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12903Accepted Submission(s): 354...
阅读全文
摘要:Jungle RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5012Accepted Submission(s): 3641Proble...
阅读全文
摘要:欧拉回路Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10239Accepted Submission(s): 3739Problem Descr...
阅读全文
摘要:More is betterTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 17683Accepted Submission(s): 6493P...
阅读全文
摘要:Ice_cream's world ITime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 741Accepted Submission(s): 429P...
阅读全文
摘要:并查集+欧拉树的判定时间限制:1000ms | 内存限制:65535KB难度:4描述A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more ...
阅读全文
摘要:欧拉+并查集一笔画问题时间限制:3000ms | 内存限制:65535KB难度:4描述zyc从小就比较喜欢玩一些小游戏,其中就包括画一笔画,他想请你帮他写一个程序,判断一个图是否能够用一笔画下来。规定,所有的边都只能画一次,不能重复画。输入第一行只有一个正整数N(N#include#define M...
阅读全文
摘要:并查集+最小生成树畅通工程Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19824Accepted Submission(s): 8449Prob...
阅读全文
摘要:并查集+最小生成树畅通工程再续Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17569Accepted Submission(s): 5477Pr...
阅读全文
摘要:并查集+最小生成树Ice_cream’s world IIITime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1121Accepted Submiss...
阅读全文
摘要:并查集+最小生成树Eddy's pictureTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7669Accepted Submission(s):...
阅读全文
摘要:并查集+最小生成树Constructing RoadsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15844Accepted Submissio...
阅读全文
摘要:并查集+最小生成树布线问题时间限制:1000ms | 内存限制:65535KB难度:4描述南阳理工学院要进行用电线路改造,现在校长要求设计师设计出一种布线方式,该布线方式需要满足以下条件:1、把所有的楼都供上电。2、所用电线花费最少输入第一行是一个整数n表示有n组测试数据。(n#includeusi...
阅读全文