并查集
文章平均质量分 81
xiaoxiede_wo
这个作者很懒,什么都没留下…
展开
-
并查集
https://cn.vjudge.net/contest/157779#problem/BLittle A gets to know a new friend, Little B, recently. One day, they realize that they are family 500 years ago. Now, Little A wants to know whether Litt...原创 2017-04-11 13:23:51 · 278 阅读 · 0 评论 -
A Bug's Life(种类并查集)
Background Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with bugs of the opposite gender原创 2017-06-28 08:26:09 · 484 阅读 · 1 评论 -
NBUT - 1451 Elise
Elise is the Spider Queen . She has a skill, Spider Form (蜘蛛形态) . When she transformed to the spider, there will be some small spiders around her. But she has a problem - the small spi原创 2017-07-10 11:32:40 · 235 阅读 · 0 评论 -
How Many Tables
Today 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 know each other, a原创 2017-05-16 20:35:03 · 199 阅读 · 0 评论 -
Wireless Network
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 computers in the ne原创 2017-06-26 16:15:33 · 157 阅读 · 0 评论 -
食物链
动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,但是我们并不知道它到底是哪一种。 有人用两种说法对这N个动物所构成的食物链关系进行描述: 第一种说法是"1 X Y",表示X和Y是同类。 第二种说法是"2 X Y",表示X吃Y。 此人对N个动物,用上述两种说法,一句接一句地原创 2017-06-29 21:04:36 · 212 阅读 · 0 评论 -
How Many Answers Are Wrong
TT and FF are ... friends. Uh... very very good friends -________-b FF is a bad boy, he is always wooing TT to play the following game with him. This is a very humdrum game. To begin with, TT should w...原创 2017-07-01 11:13:48 · 211 阅读 · 0 评论 -
小希的迷宫
上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。小希现在把她的设计图给你,让你帮忙判断她的原创 2017-06-29 19:56:54 · 165 阅读 · 0 评论 -
亲戚
[cpp] view plain copy print?题目描述 若某个家族人员过于庞大,要判断两个是否是亲戚,确实还很不容易,现在给出某个亲戚关系图,求任意给出的两个人是否具有亲戚关系。 规定:x和y是亲戚,y和z是亲戚,那么x和z也是亲戚。 如果x,y是亲戚,那么x的亲戚都是y的亲戚,y的亲戚也都是x的亲戚。 输入格式 第一行:三个整数n,m,p,(n<=5000,m...原创 2017-05-16 20:33:51 · 344 阅读 · 0 评论 -
POj1733(加权并查集)
Parity gameTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11001 Accepted: 4232DescriptionNow and then you play the following game with your friend. Your friend writes down a sequence consis...原创 2018-05-18 11:14:03 · 202 阅读 · 0 评论