zoukankan      html  css  js  c++  java
  • POJ1611:The Suspects(模板题)

    http://poj.org/problem?id=1611

    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

    0号患了病毒,只要和0号一组的人同样会患病毒。。。。

    #include <stdio.h>
    #include <string.h>
    #include <stdlib.h>
    int bin[30010];
    int q[30010];
    int n,m;
    int cmp(const void *a,const void *b)
    {
        return *(int *)a-*(int *)b;
    }
    int findx(int x)
    {
        int r,j,k;
        r=x;
        while(bin[r]!=r)
            r=bin[r];
        k=x;
        while(k!=r)
        {
            j=bin[k];
            bin[k]=r;
            k=j;
    
        }
        return r;
    }
    void merge(int x,int y)
    {
        int fx,fy;
        fx=findx(x);
        fy=findx(y);
        if(fx!=fy)
        {
            bin[fx]=fy;
        }
    }
    
    int main()
    {
        int n,x,t,i,j;
        while(scanf("%d%d",&n,&x)!=EOF)
        {
            if(n==0&&x==0) break;
            for(i=0; i<n; i++)
                bin[i]=i;
            while(x--)
            {
                scanf("%d",&t);
                memset(q,0,sizeof(q));
                for(j=0; j<t; j++)
                    scanf("%d",&q[j]);
                qsort(q,t,sizeof(q[0]),cmp);
                for(j=1; j<t; j++)
                {
                    merge(q[j],q[j-1]);
                }
    
            }
            /*for(i=0;i<n;i++)
            printf("...%d",bin[i]);*/
            int l=1;
            for(i=1; i<n; i++)
            {
                if(findx(i)==findx(0))
                    l++;
    
            }
            printf("%d
    ",l);
    
        }
        return 0;
    }
    View Code
  • 相关阅读:
    Dynamics CRM The difference between UserId and InitiatingUserId in Plugin
    Dynamics CRM2013 6.1.1.1143版本插件注册器的一个bug
    Dynamics CRM2013 从subgrid中打开快速创建窗体创建数据
    求逆元 HDU1576
    多个数的最小公倍数 HDU1019
    快速幂 HDU3003
    扩展欧几里德算法求逆元1
    筛法求素数 函数模板
    矩阵模板
    快速幂取模函数 递归模板
  • 原文地址:https://www.cnblogs.com/zhangmingcheng/p/3776748.html
Copyright © 2011-2022 走看看