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

    http://poj.org/problem?id=1611

    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

    题解:并查集

    代码:

    #include <iostream>
    #include <stdio.h>
    #include <string.h>
    using namespace std;
    
    int N, M;
    int f[30010];
    int num[30010];
    
    void init() {
        for(int i = 0; i < N; i ++)
        f[i] = i;
    }
    
    int Find(int x) {
        if(f[x] != x) f[x] = Find(f[x]);
        return f[x];
    }
    
    void Merge(int x, int y) {
      int fx = Find(x);
      int fy = Find(y);
      if(fx != fy) {
        f[fx] = fy;
      }
    }
    
    int same(int x, int y) {
        int f1 = Find(x);
        int f2 = Find(y);
        if(f1 == f2) return 1;
        else return 0;
    }
    
    int main() {
        int ans;
        while(~scanf("%d%d", &N, &M)) {
            if(!N && !M) break;
            ans = 0;
            init();
            for(int i = 1; i <= M; i ++) {
                int k;
                scanf("%d", &k);
                if(k >= 1) {
                    scanf("%d", &num[1]);
                    for(int j = 2; j <= k; j ++) {
                        scanf("%d", &num[j]);
                        Merge(num[1], num[j]);
                    }
                }
            }
    
            for(int i = 0; i < N; i ++) {
                if(same(0, i))
                    ans ++;
            }
    
            printf("%d
    ", ans);
        }
        return 0;
    }
    

      

  • 相关阅读:
    centos6系列更换阿里yum源
    javascript字符串方法学习汇总
    ORA-01439:要更改数据类型,则要修改的列必须为空
    Python之字典
    Python之元组
    Python之列表
    Tensorflow 快速学习
    Ubuntu 切换到root 授权失败
    受限玻尔兹曼机二
    Numpy 数组ndarray和常用函数速查
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9722843.html
Copyright © 2011-2022 走看看