The police office in Tadu City decides to say ends to the chaos, as launch actions to root up the TWO gangs in the city, Gang Dragon and Gang Snake. However, the police first needs to identify which gang a criminal belongs to. The present question is, given two criminals; do they belong to a same clan? You must give your judgment based on incomplete information. (Since the gangsters are always acting secretly.)
Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:
1. D [a] [b]
where [a] and [b] are the numbers of two criminals, and they belong to different gangs.
2. A [a] [b]
where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang.
Assume N (N <= 10^5) criminals are currently in Tadu City, numbered from 1 to N. And of course, at least one of them belongs to Gang Dragon, and the same for Gang Snake. You will be given M (M <= 10^5) messages in sequence, which are in the following two kinds:
1. D [a] [b]
where [a] and [b] are the numbers of two criminals, and they belong to different gangs.
2. A [a] [b]
where [a] and [b] are the numbers of two criminals. This requires you to decide whether a and b belong to a same gang.
The first line of the input contains a single integer T (1 <= T <= 20), the number of test cases. Then T cases follow. Each test case begins with a line with two integers N and M, followed by M lines each containing one message as described above.
For each message "A [a] [b]" in each case, your program should give the judgment based on the information got before. The answers might be one of "In the same gang.", "In different gangs." and "Not sure yet."
1 5 5 A 1 2 D 1 2 A 1 2 D 2 4 A 1 4
Not sure yet. In different gangs. In the same gang.
#include<stdio.h>
#define N 100010
int f[N];
int c[N];//标记是否同gang
int getf(int x) //寻找父节点及压缩路径
{
if(x==f[x])
return x;
int temp=f[x];
f[x]=getf(f[x]);
c[x]=(c[temp]+c[x])%2;//压缩路径时需寻找该结点与爷爷结点的关系,c[temp]为父亲与爷爷的关系,c[x]为x与父亲的关系,运算后c[x]成为与爷爷的关系
return f[x];
}
void merge(int x,int y)
{
int fx,fy;
fx=getf(x);
fy=getf(y);
if(fx!=fy)
{
f[fx]=fy;
c[fx]=(c[x]+c[y]+1)%2;//通过结点找到祖先,合并各个祖先时,通过运算更新俩祖先间的关系
}
}
int main()
{
int t,n,m;
int i,j,x,y;
char ch;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&n,&m);
for(i=1;i<=n;i++)
{
f[i]=i;//并查集初始化,祖先
c[i]=0; //关系初始化 ,0为同一帮派
}
getchar();
for(i=1;i<=m;i++)
{
scanf("%c %d %d",&ch,&x,&y);
getchar();
if(ch=='A')
{
if(getf(x)==getf(y))//同一祖先
{
if(c[x]==c[y])//与祖先关系相同,则同一gang
printf("In the same gang.\n");else//与祖先关系不同,则不同一gang
printf("In different gangs.\n");
}
else
printf("Not sure yet.\n");
}
else
merge(x,y);
}
}
return 0;
}