C
来源:互联网 发布:java审批流程 编辑:程序博客网 时间:2024/06/10 04:21
点击打开链接
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.
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.
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.
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
For each case, output the number of suspects in one line.
100 42 1 25 10 13 11 12 142 0 12 99 2200 21 55 1 2 3 4 51 00 0
411
#include<stdio.h>#define N 30000int m,n;int per[N+10],ran[N+10];void init(){for(int i=0;i<n;i++){per[i]=i;ran[i]=1;}}int find(int x){if(x!=per[x]) return per[x]=find(per[x]);return x;}void unite(int a,int b){int fa=find(a);int fb=find(b);if(fa!=fb){per[fb]=fa;ran[fa]+=ran[fb];}}int main(){int a,b,max,i,m,k;while(~scanf("%d %d",&n,&m)){if(n==0&&m==0) break;init();while(m--){scanf("%d",&k);if(k>=2){scanf("%d",&a);for(i=1;i<k;i++){ scanf("%d",&b); unite(a,b);}}else scanf("%d",&a);}max=ran[find(0)];printf("%d\n",max);}return 0;}
阅读全文
0 0
- c
- c
- c
- c
- C
- c
- c
- c
- C+
- c
- C
- c
- c
- c
- C
- C
- c
- C
- 大数据时代
- Linux SPI总线和设备驱动架构之一:系统概述
- Python 进程线程之间通信方式(2.1,共享数据实现进程之间通信)
- 2010-2011 ACM-ICPC Northeastern European Regional Contest (NEERC 10) G
- Nginx中的负载均衡
- C
- 【排序算法总结】直接插入排序
- 点的统计
- i am a student.转为student. a am i
- 存储管理-操作系统-程序员面试
- python进程池的复习
- 使用Docker搭建Struts2-048漏洞环境及Python PoC验证
- loadrunner录制有很多无关脚本应该怎样设置?
- 编译并使用boost库(win7+boost1.60+vs2013)