POJ 1611解题报告

The Suspects
Time Limit: 1000MS Memory Limit: 20000K
Total Submissions: 54151 Accepted: 25772

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.

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

Source
Asia Kaohsiung 2003

题目大意：计算出所有与0号同学有直接或者间接接触的人的总数。

分析：基础的并查集，版子题。

代码：

#include<iostream>
#define maxn 30005
using namespace std;

int n,m,k;
int h,s;//群头和群员
int fa[maxn],total[maxn];//记录父节点和总数

int getroot(int a)
{
	if(fa[a]==a)
		return a;
	else
		return fa[a]=getroot(fa[a]);//更新父节点，降低搜索时的时间复杂度
}

void merge(int a,int b)//合并
{
	int p1=getroot(a);
	int p2=getroot(b);
	if(p1==p2)
		return;
	else
		total[p1]+=total[p2];
		fa[p2]=fa[p1];
}
int main()
{
	while(cin>>m>>n)
	{
		for(int i=0;i<m;i++)
		{
			fa[i]=i;
			total[i]=1;
		}
		if(m==0&&n==0)
			break;
		for(int i=0;i<n;i++)
		{
			cin>>k;
			cin>>h;
			for(int i=1;i<k;i++)
			{
				cin>>s;
				merge(h,s);
			}
		}
		cout<<total[getroot(0)]<<endl;//因为0号同学可能会作为群员出现，此处需要getroot(0)
	}
	return 0;
}

后记：并查集最基础的题了，寒假学过，现在又忘了，不过学习本就是一个和遗忘作斗争的过程。加把劲