The Suspects
来源:互联网 发布:mac下完搜狗输入法 编辑:程序博客网 时间:2024/06/01 09:21
C - The Suspects
Time Limit:1000MS Memory Limit:20000KB 64bit IO Format:%lld & %lluDescription
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.
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.
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 42 1 25 10 13 11 12 142 0 12 99 2200 21 55 1 2 3 4 51 00 0
Sample Output
411
#include<stdio.h>//c#include<string.h>#include<iostream>#include<algorithm>using namespace std;int f[100010];//bool s[30010];int n,m,a,b,t;void qk(){for(int i=0; i<=100010; i++){f[i] = i;//s[i] = 0;}}int find(int x){if(x == f[x])return x;return f[x] = find(f[x]);}void fun(int x,int y){int fx = find(x);int fy = find(y);if(fx!=fy){f[fx] = fy;}}int main(){while(scanf("%d%d",&n,&t)){if(n==0)break;qk();int sum = 1;if(t == 0){printf("1\n");continue;}while(t--){scanf("%d",&m);scanf("%d",&a);//s[a] = 1;int re = a;for(int i=1; i<m; i++){scanf("%d",&a);fun(re,a);//s[a] = 1;}}for(int i=1; i<=n; i++){if(find(i) == find(0)){//s[i] == 1sum++;}}printf("%d\n",sum);}return 0;}
0 0
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- The Suspects
- iOS 给模糊加点动画
- 牛客网 8-1 网络基础 操作系统 编译与体系结构 30题知识点总结
- Mysql 分页语句Limit用法
- HDOJ 1856 More is better
- navigationBar移除黑线的方法
- The Suspects
- 面向对象六大原则
- C#学习笔记--ArrayList?List<T>?Dictionary
- 实现正六边形、圆形及带倒角正六边形的头像显示
- matlab中textread问题记录
- How Many Tables
- 整合Firebase Cloud Messaging (FCM)到Eclipse工程
- 聊天------蘑菇街2016研发工程师在线编程题
- 如何在阿里云上部署django网站(2)——使用MySQL数据库