zoukankan      html  css  js  c++  java
  • 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.

     1 #include"iostream"
     2 using namespace std;
     3 int p[100004],rela[100004];
     4 int t,n,m,a,b;
     5 char flag;
     6 void make()
     7 {
     8     for(int i=1;i<=n;i++)
     9     {
    10         p[i]=i;
    11         rela[i]=0;
    12     }
    13 } 
    14 int find(int x)
    15 {
    16     int temp=p[x];
    17     if(x==p[x])
    18        return x;
    19     p[x]=find(p[x]);
    20     rela[x]=(rela[x]==rela[temp])?0:1;
    21     return p[x];   
    22 }
    23 void unionset(int x,int y,int px,int py)
    24 {
    25     p[px]=py;
    26     rela[px]=(rela[x]==rela[y])?1:0;
    27 }
    28 int main()
    29 {
    30     cin>>t;
    31     while(t--)
    32     {
    33         cin>>n>>m;
    34         make();
    35         while(m--)
    36         {
    37             getchar();
    38             scanf("%c%d%d",&flag,&a,&b);
    39             int pa=find(a);
    40             int pb=find(b);
    41             if(flag=='A')
    42             {
    43                 if(pa!=pb)
    44                 {
    45                     cout<<"Not sure yet."<<endl;
    46                     continue;
    47                 }
    48                 if(rela[a]==rela[b])
    49                 {
    50                     cout<<"In the same gang."<<endl;
    51                     continue;
    52                 }
    53                 cout<<"In different gangs."<<endl;
    54                 continue;
    55             }
    56             if(flag=='D')
    57             {
    58                 if(p[a]!=p[b])
    59                   unionset(a,b,pa,pb);
    60             }
    61         }
    62     }
    63     return 0;
    64 }
    View Code
  • 相关阅读:
    洛谷 P4071 [SDOI2016]排列计数
    问题 G: 【一本通提高同余问题】计算器
    问题 A: 【一本通提高组合数学】Bullcow 牡牛和牝牛
    浅谈卢卡斯定理(非扩展)
    2019西安联训B层 Day 6练习题 问题 C: 扩展欧几里得
    react使用lazy()和Suspense实现根据路由进行代码分割
    react-loadable 使用高阶组件动态import组件,实现代码分割(code-splitting)
    react angular vue流行度对比
    react 服务端渲染(ssr) 框架 Next.js
    超级字符串内class正则匹配替换 可以用于css modules
  • 原文地址:https://www.cnblogs.com/767355675hutaishi/p/3763477.html
Copyright © 2011-2022 走看看