zoukankan      html  css  js  c++  java
  • poj 1611 -- The Suspects

    The Suspects
    Time Limit: 1000MS   Memory Limit: 20000K
    Total Submissions: 21611   Accepted: 10468

    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 /*======================================================================
     2  *           Author :   kevin
     3  *         Filename :   TheSuspects.cpp
     4  *       Creat time :   2014-07-17 16:18
     5  *      Description :
     6 ========================================================================*/
     7 #include <iostream>
     8 #include <algorithm>
     9 #include <cstdio>
    10 #include <cstring>
    11 #include <queue>
    12 #include <cmath>
    13 #define clr(a,b) memset(a,b,sizeof(a))
    14 #define M 30010
    15 using namespace std;
    16 int father[M],_rank[M];
    17 void MakeSet()
    18 {
    19     for(int i = 0; i < M; i++){
    20         father[i] = i;
    21         _rank[i] = 1;
    22     }
    23 }
    24 int FindSet(int x)
    25 {
    26     if(x != father[x]){
    27         father[x] = FindSet(father[x]);
    28     }
    29     return father[x];
    30 }
    31 void Union(int x,int y)
    32 {
    33     x = FindSet(x);
    34     y = FindSet(y);
    35     if(x == y) return ;
    36     father[y] = x;
    37     _rank[x] += _rank[y];
    38 }
    39 int main(int argc,char *argv[])
    40 {
    41     int n,m;
    42     while(scanf("%d%d",&n,&m)!=EOF && n+m){
    43         MakeSet();
    44         int t;
    45         for(int i = 0; i < m; i++){
    46             scanf("%d",&t);
    47             int a,b;
    48             if(t) scanf("%d",&a);
    49             for(int j = 1; j < t; j++){
    50                 scanf("%d",&b);
    51                 Union(a,b);
    52                 a = b;
    53             }
    54         }
    55         int pa = FindSet(0);
    56         printf("%d
    ",_rank[pa]);
    57     }
    58     return 0;
    59 }
    View Code
    Do one thing , and do it well !
  • 相关阅读:
    pandas 排序替换总结
    pandas 布尔值筛选总结
    矩阵的常见4中分解总结
    六,投资管理流程有投资者需求
    五,另类投资
    四 衍生工具
    使用webOffice开源js的一些先修知识
    文档填充遇到一些问题
    Swagger的配置与使用
    彻底刷新chrome浏览器的操作
  • 原文地址:https://www.cnblogs.com/ubuntu-kevin/p/3851435.html
Copyright © 2011-2022 走看看