hdu 1829 A Bug's Life

#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <stack>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#include <time.h>using namespace std;const int N=2000+5;int bin[N],sex[N],flag;void init(){    for(int i=0; i<N; i++)    {        bin[i]=i;        sex[i]=0;    }    flag=0;}int _find(int x){    if(x==bin[x]) return x;    int temp=_find(bin[x]);    sex[x]=(sex[x]+sex[bin[x]])%2;    bin[x]=temp;    return bin[x];}void _union(int x,int y){    int a=_find(x),b=_find(y);    if(a==b)    {        if(sex[x]==sex[y])            flag=1;        return ;    }    bin[a]=b;    sex[a]=(sex[x]+sex[y]+1)%2;}int main(){    int i,T,n,t,k,x,y;    scanf("%d",&T);    for(k=1; k<=T; k++)    {        scanf("%d%d",&n,&t);        init();        for(i=0; i<t; i++)        {            scanf("%d%d",&x,&y);            if(flag) continue;            _union(x,y);        }        printf("Scenario #%d:\n",k);        if(!flag)            printf("No suspicious bugs found!\n");        else            printf("Suspicious bugs found!\n");            printf("\n");    }    return 0;}