本文共 2551 字，大约阅读时间需要 8 分钟。

Find them, Catch them

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
   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.

#include
   
    char st[3];int ma[100011],pa[100011];int find(int p){    if(p == ma[p])        return  p;    int kl = ma[p];     ma[p] = find(ma[p]);    pa[p] = (pa[p] + pa[kl]) % 2;    return ma[p];}void solve(int x,int y){    int fx = find(x);    int fy = find(y);    ma[fy] = fx;    pa[fy] = (pa[x] - pa[y] + 1) % 2 ;}int main(){    int T,N,M,a,b,i;    scanf("%d",&T);    while(T--)    {        scanf("%d%d",&N,&M);        for(i = 1 ; i <= N; i++)        {            ma[i] = i;            pa[i] = 0;        }        while(M--)        {           scanf("%s%d%d",st,&a,&b);           if(st[0] == 'D')                solve(a,b);           else                {                  if(find(a) == find(b))                  {                      if(pa[a] == pa[b])                        printf("In the same gang.\n");                      else                        printf("In different gangs.\n");                  }                  else                    printf("Not sure yet.\n");                }        }    }    return 0;}
   

转载地址：https://blog.csdn.net/WYK1823376647/article/details/52618171 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！