POJ1703 Find them, Catch them

思考：怎么建立和表示不是同一个帮派的关系，是问题的关键。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>

using namespace std;
const int maxn = 100100;
const int bound = 100000;

int f[maxn*2];
int gn, gm;

int getFather(int x) {
	if(x == f[x]) return x;
	else return f[x] = getFather(f[x]);
}

int main()
{
	int T;
	char ch;
    int x, y;
	scanf("%d", &T);
	while(T--) {
		scanf("%d%d", &gn, &gm);
		getchar();
		for(int i = 1; i <= bound*2; i++) f[i] = i;
		for(int i = 0; i < gm; i++) {
			scanf("%c%d%d", &ch, &x, &y);
			getchar();
			int t1 = getFather(x);
			int t2 = getFather(y);
			int p2 = getFather(x+bound);// WA. getfater(x+maxn).
			int p1 = getFather(y+bound);
			if(ch == 'A') {
				if(t1 == t2) printf("In the same gang.\n");
				else if( t1==p1 || t2==p2) printf("In different gangs.\n");
				else printf("Not sure yet.\n");
			}
			else {
				if(t1==p1 || t2==p2) continue;
				else {
					f[p2] = t2;
					f[p1] = t1;
				}
			}
		}
	}
	return 0;
}