POJ 1703 Find them, Catch them 并查集 + 权值

Find them, Catch them

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 31528		Accepted: 9711

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.

题意 ：

 A  1 2 ： 问编号为 1 的人与编号为2的人有什么关系（即是不是一个帮派 或 还不知道）

 D  1 2 ：表示1 和 2 不是一个帮派的 

  这道题看似跟权值没关系，其实用并查集的话就需要权值，因为并查集是合并同类的，而合并不同类的就需要用不同的权值区分同于不同。将同一帮派的权值赋为0，不同的赋为1。

比如 ： 1 -> 2   1 

             2 -> 3  0

             1 -> 3  (1+0) % 2 = 1

              可以看做向量 1->2 + 2->3 = 1-> 3

              所以推出公式 dis[1] = (dis[2] + dis[1]) % 2

比如 ：已知 1->2 1

                    3->4 0

         D 1->3

           问 2 -> 4 ? 

          用向量：2->4 = 4->3 + 3->1 + 1 -> 2

          即 dis[2] = (dis[3]  - dis[1] + 1) % 2

等价于  若 dis[3] == dis[1]   dis[2] = 1;

                 dis[3] != dis[1]    dis[2] = 0; 

#include
   
   
    
    
#include
    
    
     
     
int f[100005];
int rank[100005];
int find(int x)
{
    if(f[x] == x)
    return f[x];
    int t = f[x];
    f[x] = find(f[x]);
    rank[x] = (rank[x]+rank[t])%2;/*公式1*/
    return f[x];
}
void merge(int a,int b)
{
    int x1 = find(a);
    int y1 = find(b);
    if(x1 != y1){
        f[y1] = x1;
        /*公式2 推论*/
        if(rank[a] == rank[b])
            rank[y1] = 1;
        else if(rank[a] != rank[b])/* "else"*/
            rank[y1] = 0;
    }
}
int main()
{
    int n,T,m;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d",&n,&m);
        for(int i = 1; i <= n; i++)
        {
            f[i] = i;
            rank[i] = 0;
        }
        while(m--)
        {
            getchar();
            char ch;
            scanf("%c",&ch);
            if(ch == 'A'){
                    int x,y;
                    scanf("%d%d",&x,&y);
                    int xx = find(x);
                    int yy = find(y);
                    if(xx == yy){
                        if(rank[x] == rank[y])/*若rank 相同则在同一帮派*/
                           printf("In the same gang.\n");
                        else
                           printf("In different gangs.\n");
                    }
                    else
                        printf("Not sure yet.\n");
            }
            else
            {
                int a,b;
                scanf("%d%d",&a,&b);
                merge(a,b);
            }
        }
    }
    return 0;
}