(并查集) poj 1703

时间：2015-01-31 19:21:31 阅读：117 评论：0 收藏：0 [点我收藏+]

标签：

Find them, Catch them

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 33284		Accepted: 10258

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

Sample Output

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

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
int tt,n,m,fa[100010],a[100010];
char s[5];
int find(int x)
{
      return x==fa[x]?x:fa[x]=find(fa[x]);
}
void Union(int x,int y)
{
      int fx,fy;
      fx=find(x),fy=find(y);
      if(fx!=fy)
            fa[fx]=fy;
}
int main()
{
      int x,y;
      scanf("%d",&tt);
      while(tt--)
      {
            memset(a,0,sizeof(a));
            scanf("%d%d",&n,&m);
            for(int i=0;i<=n;i++)
                  fa[i]=i;
            for(int i=1;i<=m;i++)
            {
                scanf("%s",s);
                if(s[0]==‘D‘)
                {
                    scanf("%d%d",&x,&y);
                    if(a[x]==0)
                    {
                          a[x]=y;
                    }
                    else
                    {
                          Union(a[x],y);
                    }
                    if(a[y]==0)
                    {
                          a[y]=x;
                    }
                    else
                    {
                          Union(a[y],x);
                    }
                }
                else if(s[0]==‘A‘)
                {
                      scanf("%d%d",&x,&y);
                      int fx,fy;
                      fx=find(x),fy=find(y);
                      if(fx==fy)
                      {
                            printf("In the same gang.\n");
                      }
                      else if(fx==find(a[y]))
                      {
                            printf("In different gangs.\n");
                      }
                      else
                      {
                            printf("Not sure yet.\n");
                      }
                }
            }
      }
      return 0;
}

(并查集) poj 1703

标签：

原文地址：http://www.cnblogs.com/a972290869/p/4264474.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行