acm_并查集
文章平均质量分 92
kongming_acm
kongming_acm
展开
-
1182 食物链
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 16838 Accepted: 4692<br />Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 <br />现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 <br />有人用两种说法对这N个动物所构成的食物链关系进行描述: <br />第一种说法是"1 X Y",表示X原创 2010-07-12 13:37:00 · 504 阅读 · 0 评论 -
hdu 3234 Exclusive-OR 有权并查集
Exclusive-OR<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)<br />Total Submission(s): 302 Accepted Submission(s): 92<br /><br />Problem DescriptionYou are not given n non-negative integers X0, X1, ..., Xn-1 less原创 2010-09-01 22:00:00 · 835 阅读 · 0 评论 -
hdu 1198 Farm Irrigation 并查集
<br />Farm Irrigation<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 1199 Accepted Submission(s): 523<br /><br />Problem Description<br />Benny has a spacious farm land to irrigate. The原创 2010-08-15 21:39:00 · 545 阅读 · 0 评论 -
hdu 1242 并查集
畅通工程<br />Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 8685 Accepted Submission(s): 4333<br /><br />Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交原创 2010-08-11 23:21:00 · 471 阅读 · 0 评论 -
vijos 1112 小胖的奇偶 并查集+哈希表
描述 Description huyichen和xuzhenyi在玩一个游戏:他写一个由0和1组成的序列。 huyichen选其中的一段(比如第3位到第5位),问他这段里面有奇数个1 还是偶数个1。xuzhenyi回答你的问题,然后huyichen继续问。 xuzhenyi有可能在撒谎。huyichen要检查xuzhenyi的答案,指出在xuzhenyi的第几个回答一定有问题。 有问题的意思就是存在一个01序列满足这个回答前的所有回答,而且不存在序列 满足这个回答前的所有回答及这个回答。原创 2010-07-17 11:27:00 · 2511 阅读 · 1 评论 -
3866 Cheering up the Cows kruskal 北师大oj
Cheering up the Cows<br />Time Limit: 1000 ms Case Time Limit: 1000 ms Memory Limit: 65536 KB<br />Submit: 38 Accepted: 19 <br />Description<br /><br />Farmer John has grown so lazy that he no longer wants to continue maintaining the cow paths原创 2010-07-13 14:08:00 · 696 阅读 · 0 评论 -
2236 Wireless Network
Wireless NetworkTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 8513 Accepted: 3585<br />DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an原创 2010-07-12 13:41:00 · 437 阅读 · 0 评论 -
2524 Ubiquitous Religions
Ubiquitous ReligionsTime Limit: 5000MS Memory Limit: 65536K Total Submissions: 11512 Accepted: 5436 DescriptionThere are so many different religions in the world today that it is difficult to keep track of them all. You are interested in find原创 2010-07-12 13:36:00 · 514 阅读 · 0 评论 -
1611 The Suspects
The SuspectsTime Limit: 1000MS Memory Limit: 20000KTotal Submissions: 7763 Accepted: 3683<br />DescriptionSevere acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize原创 2010-07-12 13:34:00 · 420 阅读 · 0 评论 -
并查集
<br />并查集--学习详解<br />文章作者:yx_th000文章来源:Cherish_yimi (http://www.cnblogs.com/cherish_yimi/) <br /> 昨天和今天学习了并查集和trie树,并练习了三道入门题目,理解更为深刻,觉得有必要总结一下,这其中的内容定义之类的是取自网络,操作的说明解释及程序的注释部分为个人理解。<br /><br /> 并查集学习:<br />l 并查集:(union-find sets)<br />一种简原创 2010-07-12 13:31:00 · 399 阅读 · 0 评论 -
并查集
<br />并查集--学习详解<br />文章作者:yx_th000文章来源:Cherish_yimi (http://www.cnblogs.com/cherish_yimi/) <br /> 昨天和今天学习了并查集和trie树,并练习了三道入门题目,理解更为深刻,觉得有必要总结一下,这其中的内容定义之类的是取自网络,操作的说明解释及程序的注释部分为个人理解。<br /><br /> 并查集学习:<br />l 并查集:(union-find sets)<br />一种简原创 2010-07-12 13:30:00 · 569 阅读 · 0 评论 -
1861 Network kruskal
NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6420 Accepted: 2456 Special JudgeDescriptionAndrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can原创 2010-07-12 13:39:00 · 376 阅读 · 0 评论 -
2492 A Bug's Life
A Bug's LifeTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 13782 Accepted: 4423<br />DescriptionBackground<br />Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders an原创 2010-07-12 13:38:00 · 507 阅读 · 0 评论 -
hdu 3938 Portal 计算两点路上最大距离中的最小值<=L的路径个数 离线并查集
Problem DescriptionZLGG found a magic theory that the bigger banana the bigger banana peel .This important theory can help him make a po原创 2011-08-17 16:56:00 · 844 阅读 · 0 评论