Find them, Catch them

该题为种类并查集

#include <iostream>
#include <stdio.h>
using namespace std;
#define N 112345
int pre[N];
int Find(int x)
{
    if(x!=pre[x])
        pre[x]=Find(pre[x]);
    return pre[x];
}
void mix(int x,int y)
{
    x=Find(x);
    y=Find(y);
    if(x!=y)
        pre[x]=y;
}
bool panduan(int x,int y)
{
    if(Find(x)==Find(y))
        return true;
    else
        return false;
}
void init(int n)
{
    for(int i=1;i<=n*2;i++)
        pre[i]=i;
}
int main()
{
    int t;
    int x,y;
    int n,m,i,j;
    char s[5];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        init(n);
        while(m--)
        {
            scanf("%s%d%d",s,&x,&y);
            if(s[0]=='D')
            {
                mix(x,y+n);//假设分为两个城市0-n为一个城市，n-2*n为一个城市，最后判断父亲是否一样即可 
                mix(x+n,y);
            }
            if(s[0]=='A')
            {
                if(panduan(x,y))
                {
                    printf("In the same gang.\n");
                }
                else if(panduan(x,y+n)||panduan(x+n,y))
                {
                    printf("In different gangs.\n");
                }
                else
                {
                    printf("Not sure yet.\n");
                }
            }
        }
    }
    return 0;
}