
并查集
文章平均质量分 82
AnICoo1
这个作者很懒,什么都没留下…
展开
-
HDOJ 1198 Farm Irrigation
Farm IrrigationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7037 Accepted Submission(s): 3011Problem DescriptionBenny has a sp原创 2015-07-27 11:03:35 · 265 阅读 · 0 评论 -
POJ 1182 食物链 (并查集扩展应用)
食物链Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55576 Accepted: 16297Description动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。现有N个动物,以1-N编号。每个动物都是A,原创 2015-11-20 22:28:48 · 389 阅读 · 0 评论 -
POJ 1703 Find them, Catch them (并查集扩展应用)
Find them, Catch themTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37663 Accepted: 11612DescriptionThe police office in Tadu City decides to say ends to原创 2015-11-20 22:26:37 · 307 阅读 · 0 评论 -
NYOJ 42 一笔画问题(并查集+欧拉回路)
一笔画问题时间限制:3000 ms | 内存限制:65535 KB难度:4描述 zyc从小就比较喜欢玩一些小游戏,其中就包括画一笔画,他想请你帮他写一个程序,判断一个图是否能够用一笔画下来。规定,所有的边都只能画一次,不能重复画。 输入第一行只有一个正整数N(N每组测试数据的第一行有两个正整数P,Q(P随后的Q行,每行有两个正整数A,B(0输出如果存在符原创 2015-07-30 10:39:08 · 548 阅读 · 0 评论 -
HDOJ 4496 D-City (反向思维并查集)
D-CityTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 2887 Accepted Submission(s): 1020Problem DescriptionLuxer is a really bad g原创 2016-02-12 18:04:12 · 373 阅读 · 0 评论 -
HDOJ 5631 Rikka with Graph (删边判断连通性)
问题描述众所周知,萌萌哒六花不擅长数学,所以勇太给了她一些数学问题做练习,其中有一道是这样的:给出一张 nn 个点 n+1n+1 条边的无向图,你可以选择一些边(至少一条)删除。现在勇太想知道有多少种方案使得删除之后图依然联通。当然,这个问题对于萌萌哒六花来说实在是太难了,你可以帮帮她吗?输入描述第一行一个整数表示数据组数 T(T≤30)。每组数据的第一行是一个整数 n原创 2016-02-20 23:21:22 · 1108 阅读 · 0 评论 -
POJ 1988 Cube Stacking (带权并查集)
Cube Stacking Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 23347 Accepted: 8186 Case Time Limit: 1000MSDescription Farmer John and Betsy are playing a game with N (1 <= N原创 2016-07-13 16:09:42 · 1440 阅读 · 0 评论 -
POJ 1611 The Suspects (并查集)
The SuspectsTime Limit: 1000MS Memory Limit: 20000K Total Submissions: 33167 Accepted: 16083Description Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiolog原创 2016-07-31 15:50:16 · 267 阅读 · 0 评论 -
HDOJ 1325 Is It A Tree?(并查集)
Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17568 Accepted Submission(s): 3944Problem DescriptionA tree is a wel原创 2015-07-29 16:55:18 · 379 阅读 · 0 评论 -
HDOJ 1598 find the most comfortable road(并查集+贪心)
find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5340 Accepted Submission(s): 2316Problem Description原创 2015-10-21 14:11:07 · 423 阅读 · 0 评论 -
HDOJ 5326 Work (并查集)
Work Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1201 Accepted Submission(s): 734Problem DescriptionIt’s an interesti原创 2015-10-05 23:46:29 · 458 阅读 · 0 评论 -
HDOJ 1232 畅通工程 (并查集)
畅通工程Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 37132 Accepted Submission(s): 19683Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,原创 2015-07-27 10:04:11 · 366 阅读 · 0 评论 -
HDOJ 1213 How Many Tables(基础并查集)
How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17998 Accepted Submission(s): 8856Problem DescriptionToday is Igna原创 2015-07-27 10:44:16 · 390 阅读 · 0 评论 -
并查集详解(转)
转自:http://blog.youkuaiyun.com/dellaserss/article/details/7724401并查集是我暑假从高手那里学到的一招,觉得真是太精妙的设计了。以前我无法解决的一类问题竟然可以用如此简单高效的方法搞定。不分享出来真是对不起party了。(party:我靠,关我嘛事啊?我跟你很熟么?)来看一个实例,杭电1232畅通工程首先在地图上给你若干个城镇,这转载 2015-07-27 10:06:34 · 320 阅读 · 0 评论 -
HDOJ 2120 Ice_cream's world I(并查集)
Ice_cream's world ITime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 793 Accepted Submission(s): 464Problem Descriptionice_cream's原创 2015-07-29 17:03:37 · 476 阅读 · 0 评论 -
HDOJ 1856 More is better (并查集)
More is betterTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 18615 Accepted Submission(s): 6848Problem DescriptionMr Wang want原创 2015-07-29 16:47:32 · 345 阅读 · 0 评论 -
HDOJ 4707 Pet (并查集)
Pet Time Limit : 4000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 8 Accepted Submission(s) : 6Problem DescriptionOne day, Lin Ji wake up in the mornin原创 2015-08-04 21:02:56 · 453 阅读 · 1 评论 -
HDOJ 龙珠移动问题(并查集)
Problem DescriptionFive hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gather all of the dragon balls together.H原创 2015-08-05 15:02:26 · 422 阅读 · 0 评论 -
HDOJ 2473 Junk-Mail Filter(并查集集合删点+虚拟父节点)
Junk-Mail FilterTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7703 Accepted Submission(s): 2431Problem DescriptionRecognizing原创 2015-10-20 14:39:18 · 457 阅读 · 0 评论 -
HDOJ 1272 小希的迷宫(并查集)
小希的迷宫Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34428 Accepted Submission(s): 10547Problem Description上次Gardon的迷宫城堡小希玩了很久(见P原创 2015-07-29 16:53:55 · 306 阅读 · 0 评论