zoukankan      html  css  js  c++  java
  • POJ 1611 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号共同祖先即可。
    AC代码:
     1 #include<stdio.h>
     2 int getf(int v);
     3 void merge(int u,int v);
     4 int f[30010];
     5 int main()
     6 {
     7     int n,m,i,x,y,t,ans,u,v;
     8     while(scanf("%d%d",&n,&m), n+m != 0)
     9     {
    10         for(i=0;i<n;i++)
    11             f[i]=i;
    12         while(m--)
    13         {
    14             scanf("%d%d",&t,&u);
    15             while(--t)
    16             {
    17                 scanf("%d",&v);
    18                 merge(u,v);
    19                 u=v;
    20             }
    21         }
    22         for(ans=0,i=0;i<n;i++)
    23         {
    24             if(getf(i)==getf(0))
    25                 ans++;
    26         }
    27         printf("%d
    ",ans);
    28     }
    29     return 0;
    30 }
    31 void merge(int u,int v)
    32 {
    33     int t1,t2;
    34     t1=getf(u);
    35     t2=getf(v);
    36     if(t1 != t2)
    37         f[t2]=t1;
    38 }
    39 int getf(int v)
    40 {
    41     if(f[v]==v)
    42     return v;
    43     else
    44     {
    45         f[v]=getf(f[v]);
    46         return f[v];
    47     }
    48 }
  • 相关阅读:
    Linux系统调用
    Linux的中断 & 中断和异常的区别
    system v和posix的共享内存对比 & 共享内存位置
    epoll里面mmap释疑
    提高网络效率的总结
    推荐相关学习 & 典型算法、典型特征、典型推荐系统框架
    最大似然法理解
    调试多线程 & 查死锁的bug & gcore命令 & gdb对多线程的调试 & gcore & pstack & 调试常用命令
    内存屏障 & Memory barrier
    锁相关知识 & mutex怎么实现的 & spinlock怎么用的 & 怎样避免死锁 & 内核同步机制 & 读写锁
  • 原文地址:https://www.cnblogs.com/wenzhixin/p/7387685.html
Copyright © 2011-2022 走看看