（并查集 带关系）Find them, Catch them -- poj -- 1703

链接：

http://poj.org/problem?id=1703

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 36768		Accepted: 11294

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.

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <queue>
#include <algorithm>
using namespace std;

#define N 100005
#define INF 0x3f3f3f3f

int f[N], r[N], vis[N];

int Find(int x)
{
    int k = f[x];
    if(x!=f[x])
    {
        f[x] = Find(f[x]);
        r[x] = (r[x]+r[k])%2;
    }
    return f[x];
}


int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        int n, m, i, a, b;
        char s[10];

        scanf("%d%d", &n, &m);

        memset(r, 0, sizeof(r));
        memset(vis, 0, sizeof(vis));
        for(i=0; i<=n; i++)
            f[i] = i;

        for(i=1; i<=m; i++)
        {
            scanf("%s%d%d", s, &a, &b);

            if(s[0]=='D')
            {
                int fa = Find(a);
                int fb = Find(b);

                if(fa!=fb)
                {
                    f[fa]=fb;
                    r[fa] = (r[a]-r[b]+3) % 2;
                }
                vis[a] = vis[b] = 1;
            }
            else
            {
                if(vis[a]==0 || vis[b]==0)
                    printf("Not sure yet.
");
                else
                {
                    int fa = Find(a);
                    int fb = Find(b);

                    if(fa!=fb)
                        printf("Not sure yet.
");
                    else
                    {
                        if(r[a]==r[b])
                            printf("In the same gang.
");
                        else
                            printf("In different gangs.
");
                    }
                }
            }
        }

    }
    return 0;
}