poj1611 The Suspects 并查集

最新推荐文章于 2021-10-22 21:50:22 发布

原创最新推荐文章于 2021-10-22 21:50:22 发布 · 159 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

并查集及其权值专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一个使用并查集算法来模拟SARS在大学学生群体中潜在传播的程序设计案例。在一个名为Not-Spreading-Your-Sickness University的虚构环境中，一旦发现疑似病例，程序能够快速识别所有可能的接触者，以便采取隔离措施。通过输入学生数量和学生团体列表，算法能高效地找出所有潜在的感染群组。

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

思路：

并查集直接搞

代码：

#include<cstdio>
using namespace std;
const int maxn = (int)3e4 + 10;
int f[maxn];
int find(int x)
{
	if (x != f[x])
		f[x] = find(f[x]);
	return f[x];
}
void join(int x,int y)
{
	int fx = find(x),fy = find(y);
	f[fx] = fy;
}
int main()
{
	int n,m,k,x,y;
	while (~scanf("%d %d",&n,&m) && (n + m))
	{
		for (int i = 0;i < n;i ++)
			f[i] = i;
		while (m --)
		{
			scanf("%d %d",&k,&x);
			for (int i = 0;i < k - 1;i ++)
			{
				scanf("%d",&y);
				if (!find(x))
					join(y,x);
				else
					join(x,y);
			}
		}
		int ans = 0;
		for (int i = 0;i < n;i ++)
			if (find(i) == 0)
				ans ++;
		printf("%d\n",ans);
	}
	return 0;
}