poj 1703 Find them, Catch them 并查集
来源:互联网 发布:大数据存储解决方案 编辑:程序博客网 时间:2024/06/04 00:25
Find them, Catch them
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 48025 Accepted: 14817
Description
The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong to a same clan? You must give your judgment based on incomplete information. (Since the gangsters are always acting secretly.)
Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:
1. D [a] [b]
where [a] and [b] are the numbers of two criminals, and they belong to different gangs.
2. A [a] [b]
where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang.
Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:
1. D [a] [b]
where [a] and [b] are the numbers of two criminals, and they belong to different gangs.
2. A [a] [b]
where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang.
Input
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case begins with a line with two integers N and M, followed by M lines each containing one message as described above.
Output
For each message "A [a] [b]" in each case, your program should give the judgment based on the information got before. The answers might be one of "In the same gang.", "In different gangs." and "Not sure yet."
Sample Input
15 5A 1 2D 1 2A 1 2D 2 4A 1 4
Sample Output
Not sure yet.In different gangs.In the same gang.
Source
POJ Monthly--2004.07.18
#include <stdio.h>#define nsize 100010int ans[nsize], root[nsize];int find(int x) {int rt;if (root[x] != x) {rt = find(root[x]);ans[x] = ans[x] ^ ans[root[x]];//类别偏移return root[x] = rt;}return x;}void TUnion(int x, int y) {int fx, fy;fx = find(x);fy = find(y);root[fx] = fy;ans[fx] = ~(ans[y] ^ ans[x]);//类别偏移}int main() {int i, n, m, a, b;char c;int t;scanf("%d", &t);while (t--) {scanf("%d%d\n", &n, &m);for (i = 0; i <= n; i++) {ans[i] = 0;root[i] = i;}for (i = 1; i <= m; i++) {scanf("%c %d %d\n", &c, &a, &b);if (c == 'D') {TUnion(a, b);}else {if (n == 2) //特殊解printf("In different gangs.\n");else if (find(a) == find(b)) {if (ans[a] == ans[b])printf("In the same gang.\n");elseprintf("In different gangs.\n");}elseprintf("Not sure yet.\n");}}}return 0;}
阅读全文
0 0
- POJ 1703 Find them, Catch them(并查集)
- POJ 1703 Find them, Catch them //并查集
- poj 1703 Find them, Catch them 并查集
- poj 1703 Find them, Catch them(并查集)
- poj 1703 Find them, Catch them //并查集
- POJ 1703 Find them, Catch them 并查集
- poj 1703 Find them, Catch them (并查集)
- poj 1703 Find them, Catch them(种类并查集)
- poj 1703 Find them, Catch them(种类并查集)
- poj 1703 -- Find them, Catch them(并查集)
- poj 1703 Find them, Catch them(并查集应用)
- POJ 1703 Find them, Catch them (并查集)
- poj 1703 - Find them, Catch them(并查集)
- poj 1703 Find them, Catch them(关系并查集)
- POJ 1703 Find them, Catch them 种类并查集
- POJ 1703 Find them, Catch them (关系并查集)
- POJ-1703 Find them, Catch them 经典并查集
- poj 1703 Find them,Catch them 并查集
- bond-br0
- slam发展
- OKvis整理
- 【算法分析与设计】【第十一周】673. Number of Longest Increasing Subsequence
- python---面向对象,class参数、__init__方法、与函数区别
- poj 1703 Find them, Catch them 并查集
- 输入异常处理
- 基于机器视觉的机器人交互控制
- 【工具】Fiddler抓包工具使用
- 怎样在VMware虚拟机中使用安装并设置Ubuntu系统
- Kivy 中文教程 实例入门 简易画板 (Simple Paint App):1. 自定义窗口部件 (widget)
- 后端开发--Http协议(2):HTTP 1.1与HTTP 1.0的比较
- Java练习题15 判断能否构成三角形
- MySQL学习——添加新用户(1)