zoukankan      html  css  js  c++  java
  • 并查集——The Suspects

    E - The Suspects
    Time Limit:1000MS     Memory Limit:20000KB     64bit IO Format:%I64d & %I64u

    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


     1 #include<cstdio>
     2 #include<iostream>
     3 #include<cstring>
     4 using namespace std;
     5 int pre[30020],son[30020];
     6 int find(int x)
     7 {
     8     if(x==pre[x])
     9         return x;
    10     return find(pre[x]);
    11 }
    12 void join(int x,int y)
    13 {
    14     int root1,root2;
    15     root1=find(x);
    16     root2=find(y);
    17     if(root1!=root2)
    18     {
    19         pre[root2]=root1;
    20         son[root1]=son[root2]+son[root1];
    21     }
    22 }
    23 int main()
    24 {
    25     int n,m,i,k,j;
    26     while(scanf("%d%d",&n,&m)!=EOF)
    27     {
    28         if(m==0&&n==0)break;
    29         for(i=0;i<n;i++)
    30         {
    31             pre[i]=i;
    32             son[i]=1;
    33         }
    34        for(i=0;i<m;i++)
    35         {
    36             scanf("%d",&k);
    37             int *stu=new int [k];
    38             for(j=0;j<k;j++)
    39             {
    40                 scanf("%d",&stu[j]);
    41                 if(j!=0)
    42                     join(stu[j-1],stu[j]);
    43             }
    44             delete(stu);
    45         }
    46         printf("%d
    ", son[find(0)]);
    47 
    48     }
    49     return 0;
    50 }
  • 相关阅读:
    lrzsz踩坑记
    《西安游记》
    《这世界那么多人》
    Go 日常开发常备第三方库和工具
    Go 里的超时控制
    菜鸟轻松拿offer: 软件测试工程师面试秘笈
    Django 练习教程
    JasperReports入门教程(五):分组打印
    并发的特性和锁的原理,分类
    面试高频算法
  • 原文地址:https://www.cnblogs.com/dongq/p/4528601.html
Copyright © 2011-2022 走看看