• 并查集 计算节点数量


    The Suspects
    http://poj.org/problem?id=1611
    Time Limit: 1000MS   Memory Limit: 20000K
    Total Submissions: 56707   Accepted: 26887

    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>
    using namespace std;
    const int maxn=30000+5;
    const int maxm=500+5;
    int root[maxn],num[maxn];
    int n,m,k,a,b;
    int findroot(int x){
        if(root[x]==x){
            return x;
        }else{
            root[x]=findroot(root[x]);
            return root[x];
        }
    }
    void unionroot(int a,int b){
        int ra=findroot(a);
        int rb=findroot(b);
        if(ra!=rb){
            root[ra]=rb;
            num[rb]+=num[ra];
            num[ra]=0;
        }
    }
    int main(){
        while(~scanf("%d",&n)){
            if(n==0){
                return 0;
            }else{
                for(int i=0;i<=n;i++){
                    root[i]=i;
                    num[i]=1;
                }
                scanf("%d",&m);
                while(m--){
                    scanf("%d",&k);
                    if(k==1){
                        scanf("%d",&a);
                    }else{
                        scanf("%d",&a);
                        for(int i=1;i<k;i++){
                            scanf("%d",&b);
                            unionroot(a,b);
                        }
                    }
                }
            }
            printf("%d
    ",num[findroot(0)]);
        }
        return 0;
    }
  • 相关阅读:
    方差分析 | ANOVA | 原理 | R代码 | 进阶 | one way and two way | Analysis of Variance
    GT sport真实赛道详解
    如何成为F1车手?
    统计学 | 漫想
    (转)什么是P问题、NP问题和NPC问题
    一个完整的成年果蝇大脑的电子显微镜图谱 | A Complete Electron Microscopy Volume of the Brain of Adult Drosophila melanogaster
    文献导读 | A Pan-Cancer Analysis of Enhancer Expression in Nearly 9000 Patient Samples
    综述
    GSEA
    (转)决定系数R2
  • 原文地址:https://www.cnblogs.com/qqshiacm/p/11155738.html
Copyright © 2020-2023  润新知