poj_1611_The Suspects_201407251637
来源:互联网 发布:js 数字转汉字 编辑:程序博客网 时间:2024/05/05 05:51
The Suspects
Time Limit: 1000MS Memory Limit: 20000KTotal Submissions: 21861 Accepted: 10612
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
Source
Asia Kaohsiung 2003
题目大意:
有一个学校,有N个学生,编号为0-N-1,现在0号学生感染了非典,凡是和0在一个社团的人就会感染,并且这些人如果还参加了别的社团,他所在的社团照样全部感染,求感染的人数。
解题思路:
并查集的变种,实质就是求0所在的强连通图的结点数目。
代码如下:#include <stdio.h>#include <string.h>#define MAXN 30030int pre[MAXN],rank[MAXN];int find(int x){ while(x!=pre[x]) { x=pre[x]; } return x;}void join(int x,int y){ x=find(x); y=find(y); if(x!=y) { pre[y]=x; rank[x]+=rank[y]; }}//输出的时候还要查找输出值的父亲节点 //void join(int x,int y)//{//x=find(x);//y=find(y);//if(x==y)return;//if(rank[x]>=rank[y])//{//father[y]=x;//rank[x]=rank[x]+rank[y];//}else//{//father[x]=y;//rank[y]=rank[y]+rank[x];//}//}////这种方法在连接的时候以小的作为父亲,这样在输出的时候就不用再查找 0 的父亲节点了////直接printf("%d\n",rank[pre[0]]);即可 int main(){ int n,m; while(scanf("%d%d",&n,&m),n||m) { int i,j,k,num,first,next; for(i=0;i<n;i++) { pre[i]=i; rank[i]=1; } for(i=0;i<m;i++) { scanf("%d",&num); scanf("%d",&first); for(j=1;j<num;j++) { scanf("%d",&next); join(first,next); } } printf("%d\n",rank[find(0)]);// } return 0;}
0 0
- poj_1611_The Suspects_201407251637
- POJ_1611_The Suspects
- POJ_1611_The Suspects(并查集)
- scrollview 内容快速滑动解决方法
- 图像处理之卡通化
- 我的第一个Django项目:TodoList
- 第二十讲:Content Provider 使用入门
- Android技术资料
- poj_1611_The Suspects_201407251637
- 获得合资格买家的利益,通过音频视频营销中的运用
- Unreal里几个基本技巧/常识
- 使用FMDB多线程访问数据库,及database is locked的问题
- Farey Sequence(poj2478)
- 获取最好的汽车音响证明由自动影像新加坡今天
- 2014-7-25-web程序发邮件
- Kafka部署与代码实例
- 《深入浅出 Java Concurrency》目录
原创粉丝点击
热门IT博客
热门问题
老师的惩罚
人脸识别
我在镇武司摸鱼那些年
重生之率土为王
我在大康的咸鱼生活
盘龙之生命进化
天生仙种
凡人之先天五行
春回大明朝
姑娘不必设防,我是瞎子
应届专升本
专升本什么时候报考
专升本有用么
专升本跨专业
会计专升本学校
专升本招生院校
专升本和自考哪个好
全日制普通高校专升本
专升本的文凭
专升本那个专业好考
全日制专升本学校
专升本英语二
专升本考试培训
专升本需要准备什么
专升本选什么专业好
大专如何升本
大专升本科报名
专升本业余
专升本考试费用
民族大学专升本
怎么考专升本
专升本报名要求
承认专升本
大专毕业后怎么升本科
专升本学位证怎么拿
大专考本科难吗
专升本咨询电话
网络教育专升本价格
专升本经济学
专升本报考资格
专升本学医
大专毕业后怎么升本
专升本入学时间
专升本好吗
大专升本科报考
教育学专升本
精通教育专升本
专升本全日制学校
大专升本科怎么升
大专和本科有什么区别
自考专科升本科