并查集
文章平均质量分 75
Zhac
菜菜菜
展开
-
POJ2236Wireless Network(结构体,并查集)
Description An earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all c原创 2016-04-07 19:32:32 · 358 阅读 · 0 评论 -
hdoj5326Work(并查集)
Description It’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company. As is known to all, every stuff in a company has a title,原创 2016-08-01 21:17:05 · 282 阅读 · 0 评论 -
HDU 4707Pet(并查集)
Description One day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use some cheese to trap the hamster. He put原创 2016-08-01 21:09:28 · 281 阅读 · 0 评论 -
hdoj1325Is It A Tree?(并查集)
Description A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following proper原创 2016-08-01 21:06:14 · 283 阅读 · 0 评论 -
HDU 2120Ice_cream's world I(并查集+环)
Description ice_cream's world is a rich country, it has many fertile lands. Today, the queen of ice_cream wants award land to diligent ACMers. So there are some watchtowers are set up, and wall betwe原创 2016-08-01 21:01:46 · 204 阅读 · 0 评论 -
HDU 1272小希的迷宫(并查集+环)
上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。小希现在把她的设计图给你,让你帮忙判断她的原创 2016-08-01 20:58:04 · 208 阅读 · 0 评论 -
HDU 1856More is better(并查集)
Description Mr Wang wants some boys to help him with a project. Because the project is rather complex, the more boys come, the better it will be. Of course there are certain requirements. Mr Wan原创 2016-08-01 20:54:59 · 184 阅读 · 0 评论 -
hdu 5631 Rikka with Graph(并查集+枚举)
Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. There is one of them: Yuta has a non-direct graph with n vert原创 2016-08-01 20:45:46 · 671 阅读 · 0 评论 -
hdoj1232畅通工程(并查集)
Problem Description 某省调查城镇交通状况,得到现有城镇道路统计表,表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都可以实现交通(但不一定有直接的道路相连,只要互相间接通过道路可达即可)。问最少还需要建设多少条道路? Input 测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是城镇数目N原创 2015-12-26 20:06:11 · 397 阅读 · 0 评论 -
hdoj1213How Many Tables(并查集)
Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends原创 2015-12-26 20:09:48 · 288 阅读 · 0 评论 -
POJ2524Ubiquitous Religions(并查集)
Description 当今世界有很多不同的宗教,很难通晓他们。你有兴趣找出在你的大学里有多少种不同的宗教信仰。 你知道在你的大学里有n个学生(0 Input 有多组数据。对于每组数据: 第一行:两个整数n和m。 以下m行:每行包含两个整数i和j,表示学生i和j信仰相同的宗教。学生编号从1到n。 输入的最后一行中,n = m = 0。 Ou原创 2016-03-26 19:50:39 · 250 阅读 · 0 评论 -
POJ1611The Suspects(并查集)
Description 严重急性呼吸系统综合症( SARS), 一种原因不明的非典型性肺炎,从2003年3月中旬开始被认为是全球威胁。为了减少传播给别人的机会, 最好的策略是隔离可能的患者。 在Not-Spreading-Your-Sickness大学( NSYSU), 有许多学生团体。同一组的学生经常彼此相通,一个学生可以同时加入几个小组。为了防止非典的传播,NSYSU收集了所有学生团体原创 2016-03-26 22:00:37 · 295 阅读 · 0 评论 -
hdoj1878欧拉回路(并查集+欧拉回路)
Description RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿意和水域浪子原创 2016-03-31 11:27:32 · 393 阅读 · 0 评论 -
POJ1182食物链(结构体+并查集)
题目链接:http://poj.org/problem?id=1182 解题思路: 这道题是并查集题目中的经典。。。而且比普通并查集提高了一个档次,下面在基础并查集的前提上讲解并查集的真正用法。 基础回顾: find()函数找根结点的两种写法如下: 第一种递归: [cpp] view plain copy int f转载 2016-04-04 15:20:58 · 364 阅读 · 0 评论 -
hdoj2063过山车(二分图,并查集)
Problem Description RPG girls今天和大家一起去游乐场玩,终于可以坐上梦寐以求的过山车了。可是,过山车的每一排只有两个座位,而且还有条不成文的规矩,就是每个女生必须找个个男生做partner和她同坐。但是,每个女孩都有各自的想法,举个例子把,Rabbit只愿意和XHD或PQK做partner,Grass只愿意和linle或LL做partner,PrincessSnow愿原创 2016-03-31 16:22:40 · 421 阅读 · 0 评论