Find them, Catch them-POJ - 1703-并查集-白红宇的个人博客

发布日期：2022-02-10 08:11:11 浏览次数：21 分类：技术文章

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

Find them, Catch them

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.

题意：有两个帮派，有n个人和m条信息，每条信息前如果是D则说明这两个人是属于不同的帮派，如果是A则判断这两个人的关系

解题思路：用并查集保存属于一个帮派的人，处理的思路是借鉴大佬的博客（￣︶￣）↗

AC代码：#include
   
    #include
    
     #include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            #define maxn 1000000000using namespace std;typedef long long ll;int p[100005],opposite[100005];int root(int a){ return p[a]==a ? a:p[a]=root(p[a]);}void unite(int a,int b){ p[root(a)]=root(b);}int main(){ int t; cin>>t; while(t--) { int n,m; scanf("%d%d",&n,&m); memset(opposite,0,sizeof(opposite)); //用该数组保存与下标表示的人 对立的人 的编号 for(int i=1; i<=n; i++) p[i]=i; for(int i=0; i

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

上一篇：Milking Time-POJ - 3616-动态规划

下一篇：Sunscreen-POJ - 3614

发表评论

关于作者

喝酒易醉，品茶养心，人生如梦，品茶悟道，何以解忧？唯有杜康！

-- 愿君每日到此一游！