The Suspects POJ
来源:互联网 发布:河源龙川广电网络 编辑:程序博客网 时间:2024/05/29 19:11
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.
A case with n = 0 and m = 0 indicates the end of the input, and need not be processed.
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树的节点个数。把每个小组的人都进行关联,先取出每组第一个人,把第一个人和剩下k-1个人unite一下,就把关联的人全部生成一个树。这样就会生成>=1个树。其中用cnt数组记录每次unite后根节点的节点数。最后输出0对应的根节点的cnt数,OVER!
#include <stdio.h>int parent[30005]; //用来记录父亲节点int cnt [30005]; // 记录根节点的节点数int n;int group;int find(int x){ return (parent[x]==x)?x:parent[x]=find(parent[x]);}void unite(int x,int y){ x=find(x); y=find(y); if(x!=y) { parent[y]=x; cnt[x]+=cnt[y]; //这里是解题的关键,我还得再思考一下。 }}void init(){ for(int i=0;i<n;i++) { parent[i]=i; cnt[i]=1; }}int main(void){ while((scanf("%d%d",&n,&group))==2) { if(n==0 && group == 0) return 0; init(); for(int i=0;i<group;i++) { int num; scanf("%d",&num); int temp; scanf("%d",&temp); for(int j=2;j<=num;j++) { int temp1; scanf("%d",&temp1); unite(temp,temp1); } } printf("%d\n",cnt[find(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
- http、tcp/ip流程
- virtualbox 虚拟机窗口大小
- 【第七届蓝桥杯大赛个人赛(软件类)决赛B组 一步之遥】
- RxVolley进行网络请求(get方式),获取json数据
- QTP自带订票系统案例
- The Suspects POJ
- python读写文件
- M
- redis入门与安装
- JDBC连接数据库的方式
- LeetCode题目:343. Integer Break
- 5-1 求最大值及其下标 (20分)
- 操作系统复习-1.2操作系统的发展与分类
- Linux下如何用GDB调试c++程序 [版本2]