Find them, Catch them
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.
题意:警方决定捣毁两大犯罪团伙:龙帮和蛇帮,显然一个帮派至少有一人。该城有N个罪犯,编号从1至N(N<=100000。将有M(M<=100000)次操作。
D a b 表示a、b是不同帮派
A a b 询问a、b关系
思路: 一道鬼题,wa了无数次,看了题解才过,。。。3.。。。。
种类有两种,每次给出两个不同 一个肯定就是蛇帮一个就是龙帮(黑社会 呵呵呵) 我们可以假设 a b不是同一个帮派,设b + n 与b 不是一个帮派,那么a 和b + n 就是一个帮派将他们连起来,b和a + n 同理,之后直接判断根节点相同不同就可以了。
#include<stdio.h>
#include<string.h>#define maxn 100000
int pre[200005];
int finds(int x){
return x == pre[x]?x : pre[x] = finds(pre[x]);
}
void unions(int x,int y){
int xx = finds(x);
int yy = finds(y);
if(xx == yy) return ;
else{
if(xx < yy) pre[xx] = yy;
else pre[yy] = xx;
}
}
int main()
{
int n;
scanf("%d",&n);while(n --){
int x,y;
scanf("%d%d",&x,&y);
for(int i = 0; i <= 2*x; i++){
pre[i] = i;
}
for(int i = 0; i < y; i ++){
int a,b;
char c;
scanf(" %c%d%d",&c,&a,&b);
getchar();
if(c == 'A'){
if(finds(a) == finds(b)) printf("In the same gang.\n");
else if(finds(a) == finds(b + x)) printf("In different gangs.\n");
else printf("Not sure yet.\n");
}
else{
unions(a,b + x);
unions(b,a + x);
}
}
}
}