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

    The Suspects

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

    [Submit]   [Go Back]   [Status]  

    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
     
    思路: 记录每个集合的个数,合并时候计算合并后根节点的个数
     
    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<string>
    #include<algorithm>
    using namespace std;
    
    const int maxn=30000+5;
    int p[maxn], cnt[maxn];
    int n,m;
    int ans;
    
    void make_set()
    {
        for(int i=0;i<=n;i++)
        {
            p[i]=i;
            cnt[i]=1;
        }
    }
    
    int find_set(int x)
    {
        return p[x]!=x ? p[x]=find_set(p[x]) : x;
    }
    
    void union_set(int x, int y)
    {
        int fx=find_set(x), fy=find_set(y);
        if(fx!=fy)
        {
            p[fx]=fy;
            cnt[fy]=cnt[fx]+cnt[fy];
        }
    }
    
    int main()
    {
        while(scanf("%d%d", &n, &m)==2 && (n || m)) {
            make_set();
            for(int i=0;i<m;i++) {
                int k; scanf("%d", &k);
    
                int x; scanf("%d", &x);
                for(int j=1;j<k;j++)
                {
                    int y; scanf("%d", &y);
                    union_set(x, y);
                }
            }
            printf("%d
    ", cnt[find_set(0)]);
        }
    
        return 0;
    }

  • 相关阅读:
    AcWing 1059. 股票买卖 VI Leetcode714. 买卖股票的最佳时机含手续费 dp
    AcWing 1058. 股票买卖 V Leetcode309. 最佳买卖股票时机含冷冻期
    Js取float型小数点后两位数的方法
    浏览器退 事件
    微信中得到的GPS经纬度放在百度,腾迅地图中不准的原因及处理
    dropdownlist 控件的判断
    有一个无效 SelectedValue,因为它不在项目列表中。
    CSS从大图中抠取小图完整教程(background-position应用)
    去掉 input type="number" 右边图标
    页面中星号与字体对齐
  • 原文地址:https://www.cnblogs.com/cute/p/3904643.html
Copyright © 2011-2022 走看看