A - The Suspects ///并查集

A - The Suspects

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.
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.
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
思路:n个学生,m个小组,每个小组有k个人,只要是和0在一个组的人或者和0的组员在一起的人,都是传染者
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int c[30001];
int a[30001];
int n,m,k;
int find(int x)
{
    /* 超时
    if(c[x]==x)
    return x;
    else
    return find(c[x]); 
    */
    /*
    if(c[x]==x)
    return x;
    else
    return c[x]=find(c[x]);  // 剪枝
    */
 return c[x]==x?x:c[x]=find(c[x]);
}
void u(int x,int y)
{
	int a=find(x);
	int b=find(y);
	if(a!=b)
	  c[b]=a;
}
int main()
{
	while(scanf("%d%d",&n,&m)&&(n||m))
	{
		for(int i=0;i<n;i++)
		{
			c[i]=i;
		}
		int cnt=0;
		while(m--)
		{
			scanf("%d",&k);
			scanf("%d",&a[0]);
			for(int i=1;i<k;i++)
			{
				scanf("%d",&a[i]);
				u(a[0],a[i]);
			}
		}
		for(int i=0;i<n;i++)
		{
			if(find(i)==c[0])
			   cnt++;
		}
		printf("%d\n",cnt);
	}
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/LMengi000/article/details/79981096
个人分类: ACM并查集
上一篇筛选素数模板
下一篇并查集模板
想对作者说点什么? 我来说一句

poj 1611 The Suspects 代码

2008年03月08日 1KB 下载

没有更多推荐了,返回首页

关闭
关闭