并查集

D - 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

遇到过最深的坑，但是也很常见，所有有联系的数合成一个集合，要最后再去find（）一遍，找到最原始的根，如果不这样，有可能会造成这个值所对应的根不是最原始的根，只是中间的一个结点，所以一定要去find()一遍。。。

#include<cstdio>
#include<cmath>
#include<set>
#include<map>
#include<cstring>
#include<algorithm>
using namespace std;
int ff[30005];

void init(int n)
{
	for(int i=0;i<n;i++)
	    ff[i]=i;
}

int find(int x)
{
	if(x!=ff[x])
	    return ff[x]=find(ff[x]);
	return x;
}

void un(int x,int y)
{
	int a=find(x);
	int b=find(y);
	if(a==b)
	    return ;
	else if(a<b)
	    ff[b]=a;
	else
	    ff[a]=b;
}
int main()
{
	int n,m,t,first,next;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		init(n);
		if(n==0&&m==0)
		    break;
		while(m--)
		{
			scanf("%d%d",&t,&first);
			for(int i=1;i<t;i++)
		    {
		    	scanf("%d",&next);
		    	un(first,next);
			}
		}
		int sum=0;
		for(int i=0;i<n;i++)
		{
			if(find(i)==0)
			  sum++;
		}
		printf("%d\n",sum);
	}
	return 0;
}