zoukankan      html  css  js  c++  java
  • 并查集模板题(The Suspects )HZNU寒假集训

    The Suspects


    Time Limit: 1000MS Memory Limit: 20000K
    Total Submissions: 36817 Accepted: 17860

    Description

    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


    Source

    Asia Kaohsiung 2003

    题意:非典传染给出n个人,m组人,规定0号人为非典的携带者,与他一组的人都将感染

    m组人中输入第一个数为k,表示这组的人数

     1 #include<iostream>
     2 #include<cstdlib>
     3 #include<cstdio>
     4 #include<cstring>
     5 #include<cmath>
     6 #include<algorithm>
     7 #include<vector>
     8 using namespace std;
     9 int fa[105000];
    10 int find(int x)
    11 {
    12     return x == fa[x] ? x : find(fa[x]);
    13 }
    14 
    15 void mix(int x, int y)
    16 {
    17     int fx = find(x), fy = find(y);
    18     fa[fx] = fy;
    19 }
    20 int main()
    21 {
    22     int n,m,k,a,b;
    23     while(scanf("%d %d",&n,&m),n||m)
    24     {
    25         int ans=1;
    26         for(int i=0;i<n;i++)
    27         {
    28             fa[i]=i;
    29         }
    30         for(int i=0;i<m;i++)
    31         {
    32             scanf("%d",&k);
    33             scanf("%d",&a);
    34             for(int i=0;i<k-1;i++)
    35             {
    36                 scanf("%d",&b);
    37                 mix(a,b);
    38             }
    39         }
    40         int temp=find(0);
    41         for(int i=1;i<n;i++)
    42         {
    43             if(find(i)==temp)
    44                 ans++;
    45         }
    46         printf("%d
    ",ans);
    47     }
    48 
    49     system("pause"); 
    50     return 0;
    51 }
  • 相关阅读:
    武道之路-炼体期五重天中期
    武道之路-炼体期五重天
    武道之路-炼体期四重天巅峰
    修改Oracle监听端口
    完美解决IE(IE6/IE7/IE8)不兼容HTML5标签的方法
    Create Linked Server SQL Server 2008
    Oracle:ODP.NET Managed 小试牛刀
    jquery ajax跨域请求webservice webconfig配置
    oracle 11g ORA-12541: TNS: 无监听程序 (DBD ERROR: OCIServerAttach)
    oracle 11g 一直提示 严重: 监听程序未启动或数据库服务未注册到该监听程序
  • 原文地址:https://www.cnblogs.com/Tangent-1231/p/8477135.html
Copyright © 2011-2022 走看看