poj-1703-Find them, Catch them

2018-06-17 23:44:55来源:未知 阅读 ()

新老客户大回馈,云服务器低至5折

Find them, Catch them
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 41928   Accepted: 12886

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.

题目大意:判断俩人是否一个集团,但给的信息是谁和谁不是一个集团的,考的是祖宗节点的距离
题目链接:http://poj.org/problem?id=1703

代码:
#include <iostream>
#include <cstring>
#include <cstdio>
const int MAX=1e5+5;
using namespace std;
int rea[MAX],f[MAX];
int find(int n)
{
    if(n==f[n])
    return n;
    int tmp=f[n];
    f[n]=find(f[n]);
    rea[n]=(rea[tmp]+rea[n])%2;
    return f[n];
}
int main()
{ int t,n,m;
 cin>>t;
while(t--)
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        f[i]=i;
        rea[i]=0;
    }
    char a[10];
    int b,c;
    for(int i=0;i<m;i++)
    {
        scanf("%s",a);
        if(a[0]=='D')
        {
            scanf("%d%d",&b,&c);
            int b1=find(b),c1=find(c);
            if(b1!=c1)
            {
                    f[b1]=c1;
                    rea[b1]=(rea[b]+rea[c]+1)%2;
            }
        }
        else
        {
            scanf("%d%d",&b,&c);
            int b1=find(b),c1=find(c);
            if(b1==c1)
            {
                if(rea[b]==rea[c])
               printf("In the same gang.\n");
                else
                printf("In different gangs.\n");

            }
            else
            printf("Not sure yet.\n");
        }
    }



}
    return 0;
}
 
 
 

标签:

版权申明:本站文章部分自网络,如有侵权,请联系:west999com@outlook.com
特别注意:本站所有转载文章言论不代表本站观点,本站所提供的摄影照片,插画,设计作品,如需使用,请与原作者联系,版权归原作者所有

上一篇:大整数乘法(分治法)

下一篇:【菜鸟玩Linux开发】在Linux中使用VS Code编译调试C++项目