zoukankan      html  css  js  c++  java
  • poj 1611 The Suspects 并查集

    The Suspects
    Time Limit: 1000MS   Memory Limit: 20000K
    Total Submissions: 30522   Accepted: 14836

    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


    #include<iostream>
    #include<stdio.h>
    #define max1 30005
    using namespace std;
    int pa[max1];
    int find(int a)
    {
        while(a!=pa[a])
        {
            pa[a]=pa[pa[a]];
            a=pa[a];
        }
        return a;
    }
    void bild(int a,int b)
    {
        int fa=find(a);
        int fb=find(b);
        if(fa!=fb)
        {
            pa[fb]=fa;
        }
    }
    int main()
    {
        int n,m;
        while((scanf("%d%d",&n,&m))&&(n+m!=0))
        {
            for(int i=0;i<n;i++)
            {
                pa[i]=i;
            }
    
            for(int i=0;i<m;i++)
            {
                int p1,p2;
                int t;
                cin>>t>>p1;
                for(int j=0;j<t-1;j++)
                {
                    cin>>p2;
                    bild(p1,p2);
                }
            }
            int ans=1;
            for(int i=1;i<n;i++)
            {
                if(find(0)==find(i)) ans++;
            }
            cout<<ans<<endl;
        }
        return 0;
    }
    View Code

    这个我昨天写过博客了,但是今天做了一点点改动,就是根节点的设定变成任意的了,这样在最后搜索的时候要查找所有和 0  的根节点相同的节点。最后注意一点的是,0号同学也是一个人,不要忘了把他算入最后的结果里面去。

    Sample Output

    4
    1
    1
  • 相关阅读:
    2016年会有感之测试解决方案
    APP测试走过的那些坑
    2016年终总结——测试基础篇(二)
    2016年终总结——测试基础篇(一)
    分享篇——我的Java学习路线
    selenium使用笔记(三)——元素定位
    selenium使用笔记(二)——Tesseract OCR
    selenium使用笔记(一)——selenium你该知道的
    对新手学习自动化的一些感想
    Maven的配置和使用(三)
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5330360.html
Copyright © 2011-2022 走看看