poj1703 Find them, Catch them 种类并查集

Language:Default

Find them, Catch them

Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 29323 Accepted: 9008

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

15 5A 1 2D 1 2A 1 2D 2 4A 1 4

Sample Output

Not sure yet.In different gangs.In the same gang.

Source

POJ Monthly--2004.07.18

思路：简单的种类并查集，关于rank的更新合并已经在别的题目中详述，这里直接贴代码：

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int MAXN=100000+100;int n,m;int fa[MAXN],rank[MAXN];void init(){    for(int i=1;i<=n;i++)        fa[i]=i;    memset(rank,0,sizeof(rank));}int findset(int x){    if(fa[x]!=x)    {        int root=fa[x];        fa[x]=findset(fa[x]);        rank[x]=(rank[x]+rank[root])%2;    }    return fa[x];}int main(){    //freopen("text.txt","r",stdin);    int T;    scanf("%d",&T);    while(T--)    {        scanf("%d%d",&n,&m);        init();        for(int i=0;i<m;i++)        {            char s[2];            int x,y;            scanf("%s%d%d",s,&x,&y);            int fx=findset(x);            int fy=findset(y);            if(s[0]=='D')            {                if(fx==fy)                    continue;                fa[fx]=fy;                rank[fx]=(rank[x]+rank[y]+1)%2;            }            else            {                if(fx!=fy)                    printf("Not sure yet.\n");                else if(rank[x]==rank[y])                    printf("In the same gang.\n");                else                    printf("In different gangs.\n");            }        }    }    return 0;}