先贴代码,过后再贴上这类题目的总结
#include <iostream>
#include <stdio.h>
using namespace std;
const int N=100010;
int pre[N];
int r[N];
void make_set(int n)
{
for(int i=1;i<=n;i++)
{
pre[i]=i;
r[i]=1;
}
}
int find(int x)
{
if(x==pre[x])
return x;
int tx=find(pre[x]);
r[x]=(r[x]+r[pre[x]]+1)%2;
return pre[x]=tx;
}
void union_set(int x,int y)
{
int tx=find(x);
int ty=find(y);
if(tx!=ty)
{
pre[tx]=ty;
r[tx]=(r[x]+r[y])%2;
}
}
int main()
{
int t,n,m,x,y;
char ch;
cin>>t;
while(t--)
{
cin>>n>>m;
make_set(n);
for(int i=0;i<m;i++)
{
getchar();
scanf("%c%d%d",&ch,&x,&y);
if(ch=='A')
{
if(find(x)==find(y))
{
if((r[x]+r[y])%2==0)
cout<<"In the same gangs."<<endl;
else
cout<<"In different gangs."<<endl;
}
else cout<<"Not sure yet."<<endl;
}
else
union_set(x,y);
}
}
}