并查集
HonniLin
double fighting
展开
-
Wireless Network
Time Limit:10000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical t原创 2014-03-12 19:03:55 · 565 阅读 · 0 评论 -
ZOJ 3789 - Gears (并查集)
题目:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3789题意:N个齿轮,M个询问。D u:将齿轮u从集合中分离。 L u v:将齿轮u,v链接。Q u v:询问齿轮u,v的转向是否相同。 S u:询问齿轮u所在的集合的齿轮个数。思路:明显的并查集。1. 使用id数组去记录每一原创 2015-07-20 12:40:51 · 638 阅读 · 0 评论 -
poj 1558-Segment set (并查集+计算几何)
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3102 Accepted Submission(s): 1166Problem DescriptionA segment and all segment原创 2014-03-21 18:09:11 · 778 阅读 · 0 评论 -
小希的迷宫
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 22624 Accepted Submission(s): 6915Problem Description上次Gardon的迷宫城堡小希玩了很久(见Pro原创 2014-03-15 15:53:10 · 620 阅读 · 0 评论 -
畅通工程
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25995 Accepted Submission(s): 13584Problem Description某省调查城镇交通状况,得到现有城镇道路统计表,原创 2014-03-15 23:09:55 · 644 阅读 · 0 评论 -
食物链
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescription动物王国中有三类动物A,B,C,这三类动物的食物链构成了有趣的环形。A吃B, B吃C,C吃A。 现有N个动物,以1-N编号。每个动物都是A,B,C中的一种,原创 2014-03-10 16:02:31 · 685 阅读 · 0 评论 -
Agri-Net
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionFarmer John has been elected mayor of his town! One of his campaign promises was原创 2014-03-09 18:29:31 · 633 阅读 · 1 评论 -
Find them, Catch them
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionThe police office in Tadu City decides to say ends to the chaos, as launch actio原创 2014-03-09 18:23:56 · 566 阅读 · 0 评论 -
Back to Underworld
Time Limit:4000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionThe Vampires and Lykans are fighting each other to death. The war has become so fierce原创 2014-03-14 23:05:37 · 709 阅读 · 0 评论 -
Corporative Network
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit StatusDescriptionA very big corporation is developing its corporative network. In the beginning each原创 2014-03-12 11:54:26 · 659 阅读 · 0 评论 -
HDU 3234 - Exclusive-OR(并查集)
题目:http://acm.hdu.edu.cn/showproblem.php?pid=3234题意:n个数,R条指令。I u w : 表示第u个数是w。I u v w: 表示第u和v 个数的异或值是 w。Q k (k个数的下标):输出这k的数异或值。思路:并查集中,设fa[u]为u的祖先,val[u]为u与根异或的值。若 fa[u] = fu, fa[v]原创 2015-09-06 13:39:55 · 488 阅读 · 0 评论