poj1702

poj 1702
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<math.h>
#include<string>
#include<vector>
#include<queue>
#include<list>
using namespace std;
typedef long long lld;
typedef unsigned int ud;
#define Inf INT_MAX/2//int最大
#define Min(x,y) (x)<(y)?(x):(y)
#define Max(x,y) (x)>(y)?(x):(y)
#define MemsetMax(a) memset(a,100,sizeof a)
#define MemsetZero(a) memset(a,0,sizeof a)
#define MemsetMin(a) memset(a,-1,sizeof a)
#define PQ priority_queue
#define Q queue
#define N 100005
int parent[N];
int r[N];
int n,m;


void Init()
{
for(int i=1;i<=n;i++)
{
parent[i]=i;
r[i]=0;
}
}


int find(int x)
{
if(parent[x]==x)
return x;
int f=parent[x];
parent[x]=find(parent[x]);
r[x]=(r[x]+r[f])%2;
return parent[x];
}


void merge(int a,int b)
{
int fa=find(a);
int fb=find(b);
if(fa==fb)
return ;
parent[fb]=parent[fa];
r[fb]=(r[a]-r[b]+1)%2;
}


int main()
{
int T;
scanf("%d",&T);
while(T--)
{
scanf("%d%d%*c",&n,&m);
Init();
for(int i=1;i<=m;i++)
{
char f;
int a,b;
scanf("%c%d%d%*c",&f,&a,&b);
if(f=='D')
merge(a,b);
else if(f=='A')
{
int fa=find(a);
int fb=find(b);


if(fa==fb)
{
if(r[a]==r[b])
printf("In the same gang.\n");
else
printf("In different gangs.\n");
}
else
printf("Not sure yet.\n");
}
}
}
return 0;
}