POJ 2492 A Bug's Life 并查集

#include <iostream>
#include<cstdio>
using namespace std;
int f[3000],relation[3000];
void init(int n)
{
    for(int i=0;i<=n;i++)
    {
        f[i]=i;
        relation[i]=1;
    }
}
int find(int x)
{
    if(x==f[x]) return x;
    int tem=f[x];
    f[x]=find(f[x]);
    relation[x]=(relation[x]+relation[tem]+1)%2;
    return f[x];
}
void uni(int a,int b,int x,int y)
{
    f[x]=y;
    relation[x]=(relation[a]-relation[b])%2;
}
int main()
{
  //  freopen("cin.txt","r",stdin);
    int t,n,m,x,y,flag,a,b;
    scanf("%d",&t);
        for(int cnt=1;cnt<=t;cnt++)
        {
            scanf("%d%d",&n,&m);
            init(n);
            flag=0;
            while(m--)
            {
                scanf("%d%d",&x,&y);
                if(flag) continue;
                a=find(x),b=find(y);
                if(a==b&&relation[x]==relation[y])
                {
                    flag=1;
                    continue;
                }
                uni(x,y,a,b);//错这里了
            }
            printf("Scenario #%d:\n",cnt);
            if(flag) printf("Suspicious bugs found!\n");
            else printf("No suspicious bugs found!\n");
            printf("\n");
        }

    return 0;
}