poj 1611 dsu
2024-08-30 07:45:50
The Suspects
Time Limit: 1000MS | Memory Limit: 20000K | |
Total Submissions: 35918 | Accepted: 17458 |
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 代码:
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#define pi acos(-1.0)
#define mj
#define inf 2e8+500
typedef long long ll;
using namespace std;
const int N=3e4+;
int p[N];
int find(int x)
{
return x==p[x]?x:p[x]=find(p[x]);
}
void unit(int x,int y)
{
x=find(x),y=find(y);
if(x==y) return ;
else p[x]=y;
}
int main()
{
int n,m,x,y;
while(scanf("%d%d",&n,&m)==,n||m){
for(int i=;i<n;i++){
p[i]=i;
}
int num;
for(int i=;i<m;i++){
scanf("%d%d",&num,&x);
num--;
while(num--){
scanf("%d",&y);
unit(x,y);
}
}
int ans=;
for(int i=;i<n;i++){
if(find()==find(i)) ans++;
}
printf("%d\n",ans);
}
return ;
}
最新文章
- PHP规范PSR2
- SAMBA 服务器原理
- Cookie与Session的区别-总结很好的文章
- 【ContestHunter】【弱省胡策】【Round3】(C)
- iOS开发 autoResizingMask使用
- PS字体工具字体显示不出来
- Microsoft Internet Explorer 内存破坏漏洞(CVE-2013-3193)(MS13-059)
- C# 语法技巧_三目运算_switch_case
- RAID技术介绍和总结
- 【转】Centos 设置IP地址的几种方式
- Qt入门-字符串类QString
- Android本地视频播放器开发--视频解码
- List、Map和Set实现类
- [APUE]进程控制(中)
- MyCat配置运行
- 神州数码DHCP及DHCP中继配置
- 实验十四 第九组 张燕~杨蓉庆~杨玲 Swing图形界面组件
- [maven] ";Dynamic Web Module 3.0 requires Java 1.6 or newer."; OR ";JAX-RS (REST Web Services) 2.0 requires Java 1.6 or newer.";
- Spring RPC 入门学习(3)-获取Student对象
- Java通过BCrypt加密