poj 1611 The Suspects
来源:互联网 发布:声音狼人杀软件 编辑:程序博客网 时间:2024/06/06 05:39
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 36084 Accepted: 17545
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.
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
分析:把每组数都放在同个集合,最后找集合名字与0所在集合名字一样的即可
代码
var p,a:array[0..100000] of longint; n,m,i,j,x,ans:longint;function find(x:longint):longint;begin if p[x]=x then exit(x); p[x]:=find(p[x]); exit(p[x]);end;begin readln(n,m); while (n<>0) or (m<>0) do begin ans:=0; for i:=0 to n do p[i]:=i; for i:=1 to m do begin read(x); read(a[1]); for j:=2 to x do begin read(a[j]); p[find(a[j-1])]:=find(a[j]); end; readln; end; for i:=0 to n-1 do if find(i)=find(0) then inc(ans); writeln(ans); readln(n,m); end;end.
0 0
- POJ 1611 The Suspects
- poj 1611 The Suspects
- poj 1611 The Suspects
- POJ 1611 The Suspects
- POJ-1611 The Suspects
- POJ 1611 The Suspects
- poj 1611 The Suspects
- POJ 1611 The Suspects
- poj 1611 The Suspects
- POJ 1611 - The Suspects
- POJ 1611 The Suspects
- Poj 1611 The Suspects
- POJ 1611 The Suspects
- poj 1611 The Suspects
- POJ 1611 The Suspects
- POJ 1611 The Suspects
- poj 1611 the suspects
- POJ 1611 The Suspects
- setTimeout中的闭包
- oc语言的特点以及对象初始化
- 梁广轩_1505010601_实验1
- maven快速镜像地址
- 踩坑系列-20170301-pip 操作超时
- poj 1611 The Suspects
- 对Hadoop和Hbase的理解
- Win32 API资源分配释放速查(转)
- bzoj1026: [SCOI2009]windy数
- 字符串空格的压缩:给定一个字符串,将其中连续出现的空格压缩为1个后,将其中已空格分隔的每个字符串逆序打印出来
- 不使用按位运算符,实现或"|",与"&",左移位"<<",右移位">>"二进制运算
- WebSphere7集群部署实践与总结
- Java类加载器总结
- 双向链表C++版本