S - 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.
AC代码
//#include<bits/stdc++.h>
#define _CRT_SBCURE_NO_DEPRECATE
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <functional>
//#define UP(i,x,y) for(int i=x;i<=y;i++)
//#define DOWN(i,x,y) for(int i=x;i>=y;i--)
#define sd(x,y,z) scanf("%d%d%d", &x, &y, &z)
//#define sd(x,y) scanf("%d%d%d", &x, &y)
#define pb push_back
using namespace std;
const int maxn = 105000;
const int INF = 0x3f3f3f3f;
int n, m, t;
int ta, tb;
char str[5];
int par[maxn];
int val[maxn];
vector<int> rep;
void init()
{
for(int i = 1; i <= n; i++)
par[i] = i;
}
int Find(int x)
{
if(par[x] == x) return x;
else
{
int fa=par[x];
par[x]=Find(par[x]);
val[x]=(val[fa]+val[x])%2;
return par[x];
}
}
void unite(int x, int y)
{
int fx = Find(x);
int fy = Find(y);
if(fx==fy) return;
else
{
if(val[x] == val[y])
{
par[fx] = fy;
val[fx] = 1;
}
else
{
par[fx] = fy;
val[fx] = 0;
}
}
}
int main()
{
//freopen("in.txt", "r", stdin);
scanf("%d", &t);
while(t--)
{
memset(val, 0, sizeof val);
scanf("%d%d", &n, &m);
init();
if(n == 2)
{
for(int i = 1; i <= m; i++)
{
scanf("%s%d%d", str, &ta, &tb);
if(str[0] == 'D')
{
unite(ta, tb);
}
else if(str[0] == 'A')
{
int fa = Find(ta);
int fb = Find(tb);
if(fa == fb)
{
if(val[ta] == val[tb])
{
printf("In different gangs.\n");
}
else
{
printf("In different gangs.\n");
}
}
else
{
printf("In different gangs.\n");
}
}
}
}
else
{
for(int i = 1; i <= m; i++)
{
scanf("%s%d%d", str, &ta, &tb);
if(str[0] == 'D')
{
unite(ta, tb);
}
else if(str[0] == 'A')
{
int fa = Find(ta);
int fb = Find(tb);
if(fa == fb)
{
if(val[ta] == val[tb])
{
printf("In the same gang.\n");
}
else
{
printf("In different gangs.\n");
}
}
else
{
printf("Not sure yet.\n");
}
}
}
}
}
return 0;
}