UVA 10158 War 并查集

第一次自己写并差集一次ac，纪念一下

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>

using namespace std;

const int maxn=10000+10;

int a[maxn*2];
int n;

int findfa(int x)
{
    if(x==a[x])
        return x;
    int y=findfa(a[x]);
    return a[x]=y;
}

void myunion(int x,int y)
{
    x=findfa(x);
    y=findfa(y);
    a[x]=y;
}

int arefrind(int x,int y)
{
    if(findfa(x)==findfa(y))
        return 1;
    else
        return 0;
}

int areenemy(int x,int y)
{
    if(findfa(x+n)==findfa(y)||findfa(x)==findfa(y+n))
        return 1;
    else
        return 0;
}

int setfrind(int x,int y)
{
    if(areenemy(x,y)==1)
        return -1;
    myunion(x,y);
    myunion(x+n,y+n);
    return 1;
}

int setenemy(int x,int y)
{
    if(arefrind(x,y)==1)
        return -1;
    myunion(x,y+n);
    myunion(y,x+n);
    return 1;

}

int main()
{
    int x,y,z;
    scanf("%d",&n);
    for(int i=0;i<2*n;i++)
        a[i]=i;
    while(scanf("%d%d%d",&x,&y,&z)!=EOF&&(x||y||z))
    {
        if(x==1)
        {
            if(setfrind(y,z)==-1)
                printf("-1\n");
        }
        else if(x==2){
            if(setenemy(y,z)==-1)
                printf("-1\n");
        }
        else if(x==3){
            printf("%d\n",arefrind(y,z));
        }
        else
            printf("%d\n",areenemy(y,z));
    }
    return 0;
}
/*
10
1 0 1
1 1 2
2 0 5
3 0 2
3 8 9
4 1 5
4 1 2
4 8 9
1 8 9
1 5 2
3 5 2
0 0 0
*/