[并查集]Pku1703--Find them,Catch them

http://acm.pku.edu.cn/JudgeOnline/problem?id=1703

 

Find them, Catch them

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 11242		Accepted: 3219

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.

Source

POJ Monthly--2004.07.18

 

 

题目大意：一个城市里有两个帮派，龙帮和蛇帮。现在有n个人，给出以下信息：

D a b：表示a和b不在同一个帮里。

A a b：询问a和b的情况。答案应该是："In the same gang.", "In different gangs." and "Not sure yet."

 

分析：典型的并查集拓展应用。和Pku1182食物链很类似。对于每个人，由于不知道他是哪个帮的，把他看做是x和x+n两个人，然后并查集以下就搞定了。我一开始狂wa，原因是判断Not sure yet.那里判断错了。其实很简单，只要不是前两种情况，那么就输出not sure yet就行了= =我一开始还开了个数组.....

codes:

 

var t,n,m:longint; f,rank:array[1..200002] of longint; v:array[1..200002] of boolean; function find(x:longint):longint; begin if f[x]<>x then f[x]:=find(f[x]); exit(f[x]); end; procedure union(x,y:longint); var u,v:longint; begin u:=find(x); v:=find(y); f[u]:=v; end; procedure main; var i,x,y:longint; c:char; begin fillchar(rank,sizeof(rank),0); fillchar(v,sizeof(v),false); readln(n,m); for i:=1 to n*2 do f[i]:=i; for i:=1 to m do begin read(c); readln(x,y); if c='A' then if (find(x)=find(y+n)) or (find(x+n)=find(y)) then writeln('In different gangs.') else if (find(x)=find(y)) or (find(x+n)=find(y+n)) then writeln('In the same gang.') else writeln('Not sure yet.') else begin union(x,y+n); union(x+n,y); v[x]:=true; v[y]:=true; end; end; end; begin readln(t); while t>0 do begin main; dec(t); end; end.