POJ1703 Find them, Catch them

题目链接：POJ1703 Find them, Catch them
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 60511 Accepted: 18349

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.

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

1
5 5
A 1 2
D 1 2
A 1 2
D 2 4
A 1 4

Sample Output

Not sure yet.
In different gangs.
In the same gang.

程序说明：

并查集应用，和POJ1182食物链大同小异，如果x和y不属于一个组织，则把x和y + n，y和x + n合并。查找时若x和y在一个集合里则属于一个组织。

代码如下：

#include <iostream>
#include <cstdio>
#define MAX 100100
using namespace std;
int par[MAX * 2], rank[MAX * 2];
int t, n, m;
void init() {
	for(int i = 1; i <= n * 2; i++) {
		par[i] = i;
		rank[i] = 0;
	} 
}
int find(int x) {
	if(par[x] == x)
		return x;
	else
		return par[x] = find(par[x]);
}
void merge(int x, int y) {
	x = find(x);
	y = find(y);
	if(x == y)
		return;
	if(rank[x] < rank[y])
		par[x] = y;
	else {
		par[y] = x;
		if(rank[x] == rank[y])
			rank[x]++;
	} 
}
bool same(int x, int y) {
	return find(x) == find(y) ? true : false;
}
int main() {
	scanf("%d", &t);
	for(int i = 0; i < t; i++) {
		scanf("%d%d", &n, &m);
		init();
		for(int i = 0; i < m; i++) {
			int x, y;
			char ch;
			scanf(" %c", &ch);
			if(ch == 'D') {
				scanf("%d%d", &x, &y);	
				merge(x, y + n);
				merge(y, x + n);		
			}
			else if(ch == 'A') {
				scanf("%d%d", &x, &y);
				if(same(x, y + n) || same(y, x + n))
					printf("In different gangs.\n");
				else if(same(x, y))
					printf("In the same gang.\n");
				else
					printf("Not sure yet.\n");
			}
		}
	}
	return 0;
}