POJ 1703 Find them, Catch them （并查集扩展应用）
Find them, Catch them
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 37663 Accepted: 11612

Description

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.

Input

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.

Output

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."

Sample Input

1
5 5
A 1 2
D 1 2
A 1 2
D 2 4
A 1 4


Sample Output

Not sure yet.
In different gangs.
In the same gang.

ac代码：

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
#include<algorithm>
#define fab(a) (a)>0?(a):(-a)
#define LL long long
#define MAXN 100010
#define mem(x) memset(x,0,sizeof(x))
#define INF 0xfffffff
#define PI acos(-1.0)
using namespace std;
int pri[MAXN];
int rist[MAXN];
int find(int x)
{
int temp=pri[x];
if(pri[x]==x)
return x;
pri[x]=find(pri[x]);
rist[x]=(rist[x]+rist[temp])%2;
return pri[x];
}

int main()
{
int t,n,a,b,m,i;
char s[3];
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
pri[i]=i,rist[i]=0;
while(m--)
{
scanf("%s%d%d",s,&a,&b);
int nx=find(a);
int ny=find(b);
if(s[0]=='D')
{
if(nx!=ny)
{
pri[ny]=nx;
rist[ny]=(rist[a]+rist[b]+1)%2;
}
//printf("%d %d\n",pri[nx],pri[ny]);
}
else if(s[0]=='A')
{
//printf("%d %d\n",nx,ny);
if(nx!=ny)
printf("Not sure yet.\n");
else if(rist[a]==rist[b])
printf("In the same gang.\n");
else
printf("In different gangs.\n");
}
}
}
return 0;
}

POJ 1703 Find them, Catch them (并查集&利用异或的性质优化)

2014-01-20 10:49:22

POJ - 1703 Find them, Catch them（种类并查集）

2015-09-12 18:57:33

POJ 1703 Find them, Catch them

2014-03-28 15:18:00

poj1703 - Find them, Catch them

2012-08-09 10:32:26

zoj_3367Connect them

2013-06-04 19:05:08

POJ Find them, Catch them

2015-03-21 21:01:12

poj 1703 Find them, Catch them （并查集）

2014-11-11 09:21:42

poj 1703 Find them, Catch them 并查集

2014-05-07 22:01:23

poj 1703 Find them,Catch them 并查集

2014-05-01 16:52:06

POJ 1703 Find them, Catch them (并查集)

2014-08-03 14:38:47

不良信息举报

POJ 1703 Find them, Catch them （并查集扩展应用）