zoukankan      html  css  js  c++  java
  • POJ-1611.TheSuspects.(并查集)

    The Suspects

    Time Limit: 1000MS   Memory Limit: 20000K
    Total Submissions: 55832   Accepted: 26501

    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

    本题思路:对于加入的两个点进行合并操作,保证每个边被合并了一次即可。查找时寻找头结点与0的头结点相等的元素的个数。
     1 #include <cstdio>
     2 using namespace std;
     3 
     4 const int maxn = 30000 + 5;
     5 int n, m, num, ans, head[maxn], value[maxn];
     6 
     7 int find(int x) {
     8     if(x == head[x]) return x;
     9     return head[x] = find(head[x]);
    10 }
    11 
    12 void Union(int value[maxn], int num) {
    13     for(int i = 0; i < num; i ++) {
    14         int fx = find(value[0]);
    15         int fy = find(value[i]);
    16         if(fx == fy) continue;
    17         head[fx] = fy;
    18     }
    19 }
    20 
    21 int main () {
    22     int x;
    23     while(scanf("%d %d", &n, &m) == 2 && (n || m)) {
    24         ans = 0;
    25         for(int i = 0; i < n; i ++) head[i] = i;
    26         for(int i = 0; i < m; i ++) {
    27             scanf("%d", &num);
    28             for(int j = 0; j < num; j ++)
    29                 scanf("%d", &value[j]);
    30             Union(value, num);
    31         }
    32         for(int i = 0; i < n; i ++) find(i);
    33         int i = head[0];
    34         for(int j = 0; j < n; j ++)
    35             if(head[j] == i) ans ++;
    36         printf("%d
    ", ans);
    37     }
    38     return 0;
    39 }
  • 相关阅读:
    阿里巴巴2018秋招面经之前端岗(1~5面)
    面试分享:2018阿里巴巴前端面试总结(题目+答案 30题)
    2018年各大互联网前端面试题三(阿里)
    阿里巴巴2016前端工程师面试题
    2016 阿里校招笔试前端题目,你还记得吗?
    2018阿里前端校招分享(笔试篇)
    2017 阿里校招前端笔试题小结
    阿里2018校招编程题
    ko.js学习一
    简单的3d变换
  • 原文地址:https://www.cnblogs.com/bianjunting/p/10800776.html
Copyright © 2011-2022 走看看