并查集的经典入门题。
思路:将有联系的两个节点,节点小的看成大的父节点,每次加入节点,在修改父节点时用rank[i]记录节点i的状态。即:rank[1]表示有关系,rank[0]表示无关系。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std ;
const int N=100005;
int father[N];
int rank[N];
void Init_set(int n)
{
for(int i=1;i<=n;i++){
father[i]=i;
rank[i]=1;
}
}
int find_set(int x)
{
if(x==father[x]) return x;
else{
int tmp=father[x];
father[x]=find_set(father[x]);
rank[x]=(rank[x]+rank[tmp]+1)%2;
}
return father[x];
}
void Union_set(int x,int y)
{
int fx,fy,fa,fb;
fx=find_set(x);
fy=find_set(y);
fa=max(fx,fy);
fb=min(fx,fy);
if(fx!=fy){
father[fa]=fb;
rank[fa]=(rank[x]+rank[y])%2;
}
}
int main()
{
int t,a,b,n,m;
char op[2];
scanf("%d",&t);
while(t--){
scanf("%d %d",&n,&m);
Init_set(n);
while(m--){
scanf("%s %d %d",op,&a,&b);
if(op[0]=='A'){
if(find_set(a)==find_set(b)){
if((rank[a]+rank[b])%2==0)
printf("In the same gang.\n");
else printf("In different gangs.\n");
}
else printf("Not sure yet.\n");
}
else Union_set(a,b);
}
}
return 0 ;
}