zoukankan      html  css  js  c++  java
  • The Suspects

    Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is to separate the suspects from others. 
    In the Not-Spreading-Your-Sickness University (NSYSU), there are many student groups. Students in the same group intercommunicate with each other frequently, and a student may join several groups. To prevent the possible transmissions of SARS, the NSYSU collects the member lists of all student groups, and makes the following rule in their standard operation procedure (SOP). 
    Once a member in a group is a suspect, all members in the group are suspects. 
    However, they find that it is not easy to identify all the suspects when a student is recognized as a suspect. Your job is to write a program which finds all the suspects.

    Input

    The input file contains several cases. Each test case begins with two integers n and m in a line, where n is the number of students, and m is the number of groups. You may assume that 0 < n <= 30000 and 0 <= m <= 500. Every student is numbered by a unique integer between 0 and n−1, and initially student 0 is recognized as a suspect in all the cases. This line is followed by m member lists of the groups, one line per group. Each line begins with an integer k by itself representing the number of members in the group. Following the number of members, there are k integers representing the students in this group. All the integers in a line are separated by at least one space. 
    A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.

    Output

    For each case, output the number of suspects in one line.

    Sample Input

    100 4
    2 1 2
    5 10 13 11 12 14
    2 0 1
    2 99 2
    200 2
    1 5
    5 1 2 3 4 5
    1 0
    0 0

    Sample Output

    4
    1
    1
    并查集的模板做题直接ctrl c and ctrl v
     1 #include <iostream>
     2 using namespace std;
     3 #include<string.h>
     4 #include<set>
     5 #include<stdio.h>
     6 #include<math.h>
     7 #include<queue>
     8 #include<map>
     9 #include<algorithm>
    10 #include<cstdio>
    11 #include<cmath>
    12 #include<cstring>
    13 #include <cstdio>
    14 #include <cstdlib>
    15 #include<cstring>
    16 int a[30010];
    17 int find(int n)
    18 {
    19     if(a[n]==n)
    20         return n;
    21     else
    22         return a[n]=find(a[n]);
    23 }
    24 void duzhi(int n,int m)
    25 {
    26     int n1=find(n);
    27     int m1=find(m);
    28     if(n1!=m1)
    29     {
    30         if(m1==0)
    31             a[n1]=0;
    32         else
    33             a[m1]=n1;
    34     }
    35 }
    36 int main()
    37 {
    38     int n,m;
    39     while(cin>>n>>m)
    40     {
    41         if(n+m==0)
    42             break;
    43         for(int i=0;i<n;i++)
    44             a[i]=i;
    45              int t;
    46              while(m--)
    47              {
    48                  cin>>t;
    49                  int q1,q2;
    50                  cin>>q1;
    51                  for(int i=1;i<t;i++)
    52                     {
    53                         cin>>q2;
    54                         duzhi(q1,q2);
    55                     }
    56              }
    57              int sum=0;
    58              for(int i=0;i<n;i++)
    59                 {
    60                     find(i);
    61                     if(a[i]==0)
    62                         sum++;
    63                 }
    64         cout<<sum<<endl;
    65     }
    66     return 0;
    67 }
    View Code
  • 相关阅读:
    shell 命名管道,进程间通信
    bash shell:重定向标准错误输出
    paramiko socket.error: Int or String expected
    django csrf_token生成
    shell基础知识
    复制vi全部内容到windows ctrl+shift+c
    linux配置bridge (不同网段)
    sdk shell下脚本.soc
    X86服务器BMC基板管理控制器介绍
    linux 开启vnc
  • 原文地址:https://www.cnblogs.com/dulute/p/7295554.html
Copyright © 2011-2022 走看看