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

    The Suspects
    Time Limit: 1000MS   Memory Limit: 20000K
    Total Submissions: 17876   Accepted: 8659

    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

     求集合大小,基础题。并查。
    #include<stdio.h>
    #include<stdlib.h>
    int f[30003];
    int r[30003];
    void makeini(int n)
    {
        int i;
        for(i=0;i<=n;i++)
        {
            f[i]=i;
            r[i]=0;
        }
    }
    int find(int x)
    {
        int i=x,r;
        while(x!=f[x])
            x=f[x];
        while(i!=x)
        {
            r=f[i];
            f[i]=x;
            i=r;
        }
        return x;
    }
    void Union(int x,int y)
    {
        int x1,y1;
        x1=find(x);
        y1=find(y);
        if(x1==y1)return;
        else
        {
            f[y1]=x1;
        }
    }
    int main()
    {
        int i,j,k,n,m,x,y;
        while(scanf("%d%d",&n,&m)>0)
        {
            if(n==0&&m==0)break;
            makeini(n);
            for(i=1;i<=m;i++)
            {
                scanf("%d",&k);
                if(k>0)
                {
                    scanf("%d",&x);
                    for(j=2;j<=k;j++)
                    {
                        scanf("%d",&y);
                        Union(x,y);
                    }
                }
            }
            for(i=0;i<n;i++)
                k=find(i);
            for(i=0;i<n;i++)
            {
                r[f[i]]++;
            }
            k=f[0];
            printf("%d
    ",r[k]);
        }
        return 0;
    }
  • 相关阅读:
    Maven相关
    Git学习:如何登陆以及创建本地代码仓库、并提交本地代码至Github(最简单方法)
    Git的安装与配置
    下载网址
    .net core 2.2 部署CentOS7(5)部署.net core mvc
    .net core 2.2 部署CentOS7(4)CentOS7下载并安装.NET SDK(软件开发工具包)
    .net core 2.2 部署CentOS7(3)安装Xshell操控CentOS7
    .net core 2.2 部署CentOS7(2)给虚拟机安装CentOS7
    .net core 2.2 部署CentOS7(1)安装虚拟机
    Winfrom 基于TCP的Socket服务端 多线程(进阶版)
  • 原文地址:https://www.cnblogs.com/tom987690183/p/3163334.html
Copyright © 2011-2022 走看看