题目衔接:http://poj.org/problem?id=1703
题目大意:一个囚犯可能属于A牢,可能属于B牢,给出每个不属于同一囚牢的条件,判断两个囚犯是否属于一个囚牢;
思路:使用并查集数据结构,由于只有两个囚牢,与同一个囚犯不是一个囚牢的囚犯必然属于同一个囚牢,相同囚牢的囚犯归并带一个集合,同时记录与囚犯处于不同囚牢的囚犯集合,还是看代码吧.
#include <iostream>
#include <cstring>
using namespace std;
#define maxn 100000+10
int p[maxn],different[maxn];
int find_set(int x)
{
if(x != p[x]){
p[x] = find_set(p[x]); //寻找根节点的同时,更新节点的父节点
}
return p[x];
}
void union_set(int x,int y)
{
int a = find_set(x);
int b = find_set(y);
if(a == b)
return;
else
p[a] = b;
}
int main()
{
int cases;
scanf("%d",&cases);
while(cases--){
int n,m;
scanf("%d %d",&n,&m);
getchar(); //去除输入的回车号
for(int i=1;i<=n;i++)
p[i]=i;
memset(different,0,sizeof(different));
while(m--){
int i,j;
char c;
scanf("%c %d %d",&c,&i,&j);
getchar();
if(c == 'A'){
int a,b,c;
a = find_set(i);
b = find_set(j);
c = find_set(different[j]);
if(a == b)
cout<<"In the same gang."<<endl;
else if(a == c)
cout<<"In different gangs."<<endl;
else
cout<<"Not sure yet."<<endl;
}
else{
int p,q;
p = different[i],q = different[j];
if( !p && !q) //编号第一次出现
different[i] = j,different[j] = i;
else if(!p && q) //i第一次出现,而j已经出现过,则将i和different{j}进行union操作
different[i] = j,union_set(i,different[j]);
else if( p && !q) //....
different[j] = i,union_set(j,different[i]);
else //....
union_set(different[i],j),union_set(i,different[j]);
}
}
}
}