POJ 1703 Find them, Catch them

这道题与POJ 2492 几乎一模一样，就不多说了，直接上代码吧

//#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int maxn = 100000 + 10;
int p[maxn], r[maxn];

int Find(int a)
{
    if(p[a] == a)    return a;
    int temp = p[a];
    p[a] = Find(p[a]);
    r[a] = (r[a] ^ r[temp]);
    return p[a];
}

int main(void)
{
    #ifdef LOCAL
        freopen("1703in.txt", "r", stdin);
    #endif

    int T;
    scanf("%d", &T);
    while(T--)
    {
        int n, m, x, y;
        char cmd[10];
        scanf("%d %d", &n, &m);
        for(int i = 0; i <= n; ++i)    p[i] = i;
        memset(r, 0, sizeof(r));
        for(int i = 0; i < m; ++i)
        {
            scanf("%s %d %d", cmd, &x, &y);
            int px = Find(x);
            int py = Find(y);
            if(cmd[0] == 'A')
            {
                if(px != py)
                    printf("Not sure yet.
");
                else
                {
                    if((r[x] + r[y]) % 2)
                        printf("In different gangs.
");
                    else
                        printf("In the same gang.
");
                }
            }
            else
            {
                p[px] = py;
                r[px] = 1 - (r[x] ^ r[y]);
            }
        }
    }
    return 0;
}