POJ1611-The Suspects-ACM
The Suspects
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 23002 | Accepted: 11171 |
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 4 2 1 2 5 10 13 11 12 14 2 0 1 2 99 2 200 2 1 5 5 1 2 3 4 5 1 0 0 0
Sample Output
4 1 1
提交一直出现Wrong Answer,主要代码出错在union_set方法。
之前
void union_set(int x,int y){ x = find_set(x); y = find_set(y); if(rank[x] > rank[y]){ pa[y] = x; count[x] += count[y]; } else{ pa[x] = y; if(rank[x] == rank[y]){ rank[y]++; } count[y] += count[x]; } }
修改为
void union_set(int x,int y){ x = find_set(x); y = find_set(y); if(x==y) return; if(rank[x] > rank[y]) { pa[y] = x; count[x] += count[y]; rank[x]++; } else { pa[x] = y; rank[y]++; count[y] += count[x]; } }
通过了
#include <cstdio> const int MAXN = 30001; int pa[MAXN]; int rank[MAXN]; int count[MAXN]; void make_set(int x){ pa[x] = x; rank[x] = 0; count[x] = 1; } int find_set(int x){ if(x != pa[x]){ pa[x] = find_set(pa[x]); } return pa[x]; } void union_set(int x,int y){ x = find_set(x); y = find_set(y); if(x==y) return; if(rank[x] > rank[y]) { pa[y] = x; count[x] += count[y]; rank[x]++; } else { pa[x] = y; rank[y]++; count[y] += count[x]; } } int main(void){ int n,m; while(1){ int i; scanf("%d%d",&n,&m); if(0==n && 0==m){ break; } for(i=0;i<n;i++){ make_set(i); } for(i=0;i<m;i++){ int k,first,j; scanf("%d%d",&k,&first); for(j=1;j<k;j++){ int next; scanf("%d",&next); union_set(first,next); } } int p = find_set(0); printf("%d\n",count[p]); } return 0; }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 一个奇形怪状的面试题:Bean中的CHM要不要加volatile?
· [.NET]调用本地 Deepseek 模型
· 一个费力不讨好的项目,让我损失了近一半的绩效!
· .NET Core 托管堆内存泄露/CPU异常的常见思路
· PostgreSQL 和 SQL Server 在统计信息维护中的关键差异
· DeepSeek “源神”启动!「GitHub 热点速览」
· 我与微信审核的“相爱相杀”看个人小程序副业
· 微软正式发布.NET 10 Preview 1:开启下一代开发框架新篇章
· 如何使用 Uni-app 实现视频聊天(源码,支持安卓、iOS)
· C# 集成 DeepSeek 模型实现 AI 私有化(本地部署与 API 调用教程)