D - The Suspects
来源:互联网 发布:windows和mac内核区别 编辑:程序博客网 时间:2024/06/03 08:07
D - The Suspects
Time Limit:1000MS Memory Limit:20000KB 64bit IO Format:%I64d & %I64uDescription
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
解答:
int father[100001];int num[100001];int find(int q){while(q!=father[q])q=father[q];return q;} int cu(int x,int y){ int a=find(x); int b=find(y); int t;if(a==b)return 0;if(num[a]>num[b]){t=a;a=b;b=t;}father[a]=b;num[b]+=num[a];}#include<stdio.h>int main(){int a,b,i,c,j,d[100001];while(scanf("%d%d",&a,&b)!=EOF){if(a==0&&b==0)break;for(i=0;i<a;i++){father[i]=i;num[i]=1;}while(b--){scanf("%d",&c);for(i=0;i<c;i++)scanf("%d",&d[i]);if(c>1){for(j=1;j<c;j++)cu(d[j-1],d[j]);}}printf("%d\n",num[find(0)]);}return 0;}
0 0
- D - The Suspects
- D - The Suspects
- D - The Suspects
- D - 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
- URAL 1152 False Mirrors 状压+记忆化搜索
- 动态链接与静态链接对比
- 网络舆情监控系统的爬虫子系统开发总结
- UML九种图之交互图
- STL 之 list
- D - The Suspects
- COM组件创建过程
- ServletContext
- Android四大组件简述之BroadcastReceiver
- 头文件互相包含的问题
- 5款Windows 界面原型设计工具
- 36. Valid Sudoku
- 红黑树的插入删除-红黑树动态顺序统计
- bombing:cocos2d-x之CCDirector类2