POJ 2492 A Bug's Life

#include <stdio.h>
int n,q;
int fath[2005],a[2005];
void init()
{
for(int i=1; i<=n; i++)
{
fath[i]=i;
a[i]=0;
}
}
int findd(int x)
{
if(x==fath[x])return x;
int y=findd(fath[x]);
a[x]=(a[x]+a[fath[x]])&1;
fath[x]=y;
return y;
}
bool SetUnion(int x,int y)
{
int fx=findd(x);
int fy=findd(y);
if(fx==fy)
{
if(a[x]==a[y])return true;
else return false;
}
fath[fx]=fy;
if(a[y])
{
a[fx]=a[x];
}
else
{
a[fx]=1-a[x];
}
return false;
}
int main()
{
int t,case1=1,x,y;
scanf("%d",&t);
while(t--)
{
bool flat=true;
scanf("%d%d",&n,&q);
init();
for(int i=0; i<q; i++)
{
scanf("%d%d",&x,&y);
if(SetUnion(x,y))flat=false;
}
printf("Scenario #%d:\n",case1++);
if(!flat)puts("Suspicious bugs found!\n");
else puts("No suspicious bugs found!\n");
}
return 0;
}