poj 1703 种类并查集

题意：两个帮派，给你两个是敌对的信息，查询，输出结果。

解法：种类并查集

参考网页，虽然他写的不详细，让我理解了好半天http://blog.csdn.net/wangjian8006/article/details/7846279，有新的信息，自上而下更新帮派信息

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<vector>
#include<cmath>
#include<stdlib.h>
#include<iomanip>
#include<list>
#include<deque>
#include<map>
#include <stdio.h>
#include <deque>

#define maxn 100000+5
#define ull unsigned long long
#define rep(i,n) for(i=0;i<n;i++)
#define cle(a) memset(a,0,sizeof(a))
#define mod 90001

const ull inf = 1LL << 61;

using namespace std;
bool cmp(int a,int b){
    return a>b;
}
int n;
int fat[maxn];
int ans[maxn];
int getfat(int x)
{
    if(x==fat[x])return x;
    else
    {
        int rt=getfat(fat[x]);
        ans[x]=ans[x]^ans[fat[x]];//从上往下调整，父节点的为1表示翻转儿子的值，为0表示保持
        return fat[x]=rt;
    }
}
void uni(int a,int b)
{
    int x=getfat(a);
    int y=getfat(b);
    fat[x]=y;
    ans[x]=~(ans[a]^ans[b]);//调整根节点
}
int main()
{
    freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t;
    cin>>t;
    while(t--)
    {
        int m;
        scanf("%d%d",&n,&m);
        char str;int a,b;
        int i,j,k;
        for(i=0;i<=n;i++)
        {
            fat[i]=i,ans[i]=0;
        }
        for(i=1;i<=m;i++)
        {
            cin>>str;
            scanf("%d%d",&a,&b);
            if(str=='D')
            {
                uni(a,b);
            }
            else
            {
                int x,y;
                x=getfat(a);
                y=getfat(b);
                if(n==2){
                    cout<<"In different gangs."<<endl;
                    continue;
                }
                if(x==y)
                {
                    if(ans[a]==ans[b])
                    {
                        cout<<"In the same gang."<<endl;
                    }
                    else cout<<"In different gangs. "<<endl;
                }
                else cout<<"Not sure yet."<<endl;
            }
        }
    }
    return 0;
}