并查集
baymax520
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #464 (Div. 2) D. Love Rescue(并查集)
D. Love Rescuetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputValya and Tolya are an ideal pair, but they quarrel sometimes. Recently, Valya took ...原创 2018-03-15 20:07:41 · 203 阅读 · 1 评论 -
HDU 1213 How Many Tables (基础并查集)
How Many TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38888 Accepted Submission(s): 19371Problem DescriptionToday is Ignatius' birth...原创 2018-03-18 17:32:30 · 160 阅读 · 0 评论 -
HDU 1856 More is better(基础并查集)
More is betterTime Limit: 5000/1000 MS (Java/Others) Memory Limit: 327680/102400 K (Java/Others)Total Submission(s): 32121 Accepted Submission(s): 11346Problem DescriptionMr Wang wants some boys...原创 2018-03-22 14:54:09 · 191 阅读 · 0 评论 -
HDU 1272 小希的迷宫(基础并查集)
小希的迷宫Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58766 Accepted Submission(s): 18497Problem Description上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在...原创 2018-03-18 18:44:13 · 101 阅读 · 0 评论 -
解释的很有意思的并查集
转自http://blog.csdn.net/niushuai666/article/details/6662911例子就是杭电上的畅通工程:http://acm.hdu.edu.cn/showproblem.php?pid=1232首先在地图上给你若干个城镇,这些城镇都可以看作点,然后告诉你哪些对城镇之间是有道路直接相连的。最后要解决的是整幅图的连通性问题。比如随意给你两个点,让你判断它们是否连...转载 2018-03-13 18:55:53 · 303 阅读 · 0 评论