poj 1703

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

一道简单的并查集+偏移量的题，我规定 visa[i] = i->f[i] , vis[i] == 1 时，i 和 f[i] 不在同一阵营，否则在同一阵营。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <map>
#define N (100000+10)
using namespace std;
typedef long long ll;
int f[N],vis[N];
void init(int n);
int find_fa(int x);
//void make(char *ch,int a,int b);
int main()
{
    int t,n,m,i,j;
    scanf("%d",&t);
    while(t--)
    {
        char ch[5]; int a,b;
        scanf("%d%d",&n,&m);
        init(n);
        while(m--)
        {
            scanf(" %s%d%d",ch,&a,&b);
            int fa = find_fa(a);
            int fb = find_fa(b);
            //printf("fa=%d fb=%d\n",fa,fb);
            if(fa == fb)
            {
                if(ch[0] == 'A')
                {
                    if(vis[a] == vis[b])
                        printf("In the same gang.\n");
                    else
                        printf("In different gangs.\n");
                }
            }
            else
            {
                if(ch[0] == 'A')
                {
                    printf("Not sure yet.\n");
                }
                else
                {
                    f[fa] = fb;
                    vis[fa] = (2-vis[a]+1+vis[b])%2;
                    // fa->fb = fa->a + a->b + b->fb; 
                }

            }
        }
    }

    return 0;
}
int find_fa(int x)
{
    if(f[x] == x) return x;
    int t = f[x];
    f[x] = find_fa(f[x]);
    vis[x] = (vis[x]+vis[t])%2;
  //  printf("%vis[%d] = %d\n",x,vis[x]);
    return f[x];
}
void init(int n)
{
    for(int i=1; i<=n; i++)
    {
        f[i] = i; vis[i] = 0;
    }
}