POJ 1703 Find them, Catch them (并查集高级应用)

 

#include<iostream>
#include<cstdio>
using namespace std;
const int MAX = 1e5 + 100;
int father[MAX<<1];
int rnk[MAX<<1];
int N, M;
int find(int x){
	return x == father[x] ? x : father[x] = find(father[x]);
}
void unite(int x, int y){
	x = find(x);
	y = find(y);
	if(x == y)	return;
	if(rnk[x] < rnk[y])	father[x] = y;
	else{
		father[y] = x;
		if(rnk[x] == rnk[y]) rnk[x]++;
	}
}
bool same(int x, int y){
	return find(x) == find(y);
}
void solve(int a, int b, char c){
	if(c == 'A'){
		if(same(a, b + N))	printf("In different gangs.\n");
		else if(same(a, b))	printf("In the same gang.\n");
		else printf("Not sure yet.\n");  
	}else{
		unite(a, b + N);
		unite(a + N, b);
	}
}
int main(){
	int t;
	scanf("%d", &t);
	while(t--){
		scanf("%d%d", &N, &M);
		for(int i = 1; i <= 2 * N; ++i)
			rnk[i] = 0, father[i] = i;
		while(M--){
			int a, b;
			char c;
			getchar();
			scanf("%c%d%d", &c, &a, &b);
			solve(a, b, c);
		}
	}
	return 0;
}