poj1703并查集

#include <stdio.h>
#define maxn 330000
int father[maxn],r[maxn];//r[x]表示该节点相对于根节点的位移量， 
int find(int x)
{
int px;
px=father[x];//记录父节点 
if(father[x]==x)return father[x];
else father[x]=find(father[x]);
r[x]=(r[x]+r[px])%2;//偏移计算公式
return father[x];
}
int lianjie(int x,int y)
{
int rx,ry;
rx=find(x);
ry=find(y);
if(rx!=ry)
{
father[rx]=ry;
r[rx]=(r[x]+r[y]+1)%2;//偏移计算公式
}
}
int main(int argc, char *argv[])
{
int t,i,j;
int n,m,x1,y1,x,y;
char c;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i=0;i<maxn;i++)
{
father[i]=i;
r[i]=0;
}
getchar();
for(i=1;i<=m;i++)
 {
  scanf("%c%d%d",&c,&x,&y);
 
if (c=='D')
  {
   lianjie(x,y);
  }
  else
  {
   x1=find(x);
   y1=find(y);
   if ((x1==y1)&&(r[x]==r[y])) printf("In the same gang.\n");
   else
      if (x1==y1) printf("In different gangs.\n");
      else
       printf("Not sure yet.\n");
}
getchar();
  }
}
return 0;
}