poj1703

与1182一个思路 并查集加偏移量 不过比1182好做一些

#include <stdio.h>
int father[100005], r[100005];
void init(int n)
{
    int i;
    for(i = 1 ; i <= n ; i++)
    {
        r[i] = 0;
        father[i] = i;
    }
}
int find(int x)
{
    if(x!=father[x])
    {
        int pre = father[x];
        father[x] = find(father[x]);
        r[x] = (r[x]+r[pre])%2;
    }
    return father[x];
}
void union1(int x, int y,int d)
{
    father[x] = y;
    r[x] = d%2;
}
int main()
{
    int t, m, n, i, j, k, num, x, y;
    char c;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d%d", &m, &n);
        init(m);
        while(n--)
        {
            getchar();
            scanf("%c %d %d", &c,&x,&y);
            int pa = find(x);
            int pb = find(y);
            if(c == 'D')
           {
               if(pa!=pb)
               union1(pa,pb,r[y]-r[x]+1);
           }
           else
           {
               if(pa == pb)
               {
                   if(r[x] == r[y])
                   printf("In the same gang.\n");
                   else
                   printf("In different gangs.\n");
               }
               else
               printf("Not sure yet.\n");
           }
        }
    }
    return 0;
}