poj 2492A Bug's Life

http://poj.org/problem?id=2492

 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<iostream>
 #define maxn 100010
 int p[maxn],rela[maxn];
 using namespace std;
 int n,m;
 void make()
 {
     for(int i=; i<=n; i++)
     {
         p[i]=i;
         rela[i]=;
     }
 }
 int find1(int x)
 {
     int temp=p[x];
     if(x==p[x])
         return x;
     p[x]=find1(p[x]);
     rela[x]=(rela[x]==rela[temp])?:;
     return p[x];
 }
 void unionset(int x,int y,int px,int py)
 {
     p[px]=p[py];
     rela[px]=(rela[x]==rela[y])?:;
 }
 int main()
 {
     int t,a,b;
     scanf("%d",&t);
     for(int i=; i<=t; i++)
     {
         scanf("%d%d",&n,&m);
         bool flag=false;
         memset(rela,,sizeof(rela));
         make();
         for(int j=; j<m; j++)
         {
             scanf("%d%d",&a,&b);
             int fa=find1(a);
             int fb=find1(b);
             if(!flag){
             if(fa==fb)
             {
                 if(rela[a]==rela[b])
                 {
                      flag=true;
                 }
             }
             else
                 unionset(a,b,fa,fb);
             }
         }
          printf("Scenario #%d:\n",i);
         if(flag)
         {

             printf("Suspicious bugs found!\n\n");
         }
         else
             printf("No suspicious bugs found!\n\n");

     }
 }