#include <iostream>
#include <cstdio>
#include <iomanip>
#include <string>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <algorithm>
#include <cmath>
#include <stack>
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define l(x) (x<<1)
#define r(x) (x<<1|1)
#define ms(a,b) memset(a,b,sizeof(a))
using namespace std;
int fat[222222],t,n,m,a,b,c,d,len;
char cmd;
void init(){for(int i = 0;i<=2*n;i++)fat[i] = i;}
int findf(int x){return fat[x] == x?x:fat[x] = findf(fat[x]);}
void uni(int x,int y){ fat[findf(x)] = findf(y);}
bool same(int x,int y){return findf(x) == findf(y);}
int main(){
scanf("%d",&t);
while (t--){
len = 0;
cin>>n>>m;
scanf("%d%d",&n,&m);
init();
for(int i = 0;i<m;i++){
scanf("%c%d%d",&cmd,&a,&b);
getchar();
a--;
b--;
switch (cmd){
case 'D':
uni(a,b+n);
uni(a+n,b);
break;
case 'A':
if(same(a,b+n)||same(a+n,b))
printf("In different gangs.\n");
else if(same(a,b)||same(a+n,b+n))
printf("In the same gang.\n");
else
printf("Not sure yet.\n");
break;
default:
break;
}
}
}
return 0;
}
poj 1703
猜你喜欢
转载自blog.csdn.net/Fawkess/article/details/103224708
今日推荐
周排行