algorithm_并查集
文章平均质量分 87
theArcticOcean
Website: https://www.weiy.city
Wechat Subscription Account: 胡桃小院
展开
-
poj 1611 The Suspects(简单并查集)
题目:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=10536 Description 严重急性呼吸系统综合症( SARS), 一种原因不明的非典型性肺炎,从2003年3月中旬开始被认为是全球威胁。为了减少传播给别人的机会, 最好的策略是隔离可能的患者。 在Not-Spreading-Your-Sick原创 2015-08-10 11:17:33 · 486 阅读 · 0 评论 -
hdu 5438 Ponds(拓扑排序+并查集)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=5438 Ponds Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1620 Accepted Submission(s)原创 2015-09-15 21:29:08 · 675 阅读 · 0 评论 -
poj 2912 Rochambeau(带权并查集)
题目:http://poj.org/problem?id=2912 Rochambeau Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 2293 Accepted: 822 Description N children are playing R原创 2015-09-08 14:10:36 · 588 阅读 · 0 评论 -
hdu 1116 Play on Words(并查集+欧拉回路|| 欧拉路径)
题目:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=18117 Description Some of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it t原创 2015-08-18 14:00:10 · 739 阅读 · 0 评论 -
hdu 1558 Segment set(线段相交+并查集)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1558 Problem Description A segment and all segments which are connected with it compose a segment set. The size of a segment set is the number of s原创 2015-08-10 10:01:22 · 630 阅读 · 0 评论 -
hdu 1856 More is better(并查集)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1856 More is better Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others) Total Submission(s): 19461 Accepted Submi原创 2015-09-02 23:09:49 · 529 阅读 · 0 评论 -
hdu 1213 How Many Tables(UFS 简单并查集)
题目:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19354 Description Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how ma原创 2015-08-09 09:23:11 · 483 阅读 · 0 评论 -
poj 2236 Wireless Network(并查集)
题目:http://poj.org/problem?id=2236 Wireless Network Time Limit: 10000MS Memory Limit: 65536K Total Submissions: 19744 Accepted: 8282 Description An earthquake t原创 2015-08-28 20:45:40 · 520 阅读 · 0 评论 -
hdu 1829 A Bug's Life(带权并查集)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=86955#problem/B Description Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes t原创 2015-08-10 20:03:33 · 580 阅读 · 0 评论 -
并查集详解(转)
并查集是我暑假从高手那里学到的一招,觉得真是太精妙的设计了。以前我无法解决的一类问题竟然可以用如此简单高效的方法搞定。不分享出来真是对不起party了。(party:我靠,关我嘛事啊?我跟你很熟么?) 来看一个实例,杭电1232畅通工程 首先在地图上给你若干个城镇,这些城镇都可以看作点,然后告诉你哪些对城镇之间是有道路直接相连的。最后要解决的是整幅图的连通性问题。比如随意给你两个点转载 2015-08-10 18:51:12 · 415 阅读 · 0 评论 -
hdu 1272 小希的迷宫(并查集)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=1272 小希的迷宫 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 36174 Accepted Submission(s):原创 2015-08-26 19:25:58 · 434 阅读 · 0 评论 -
poj 1182 食物链(带权并查集)
题目:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=86955#problem/C Description 动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 有人用两原创 2015-08-10 17:09:11 · 469 阅读 · 0 评论 -
hdu 5441 Travel(带权并查集)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=5441 Travel Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1586 Accepted Submission(s原创 2015-09-17 09:32:58 · 681 阅读 · 0 评论