並查集

例題是： poj-1611

  這是一道關於疫情的題，非常適合出現在這個時候....

原題是：

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

題目大意：SARS病毒很容易傳染，在一所學校要找被感染了病毒的嫌疑人，如果一個組裏面有一個人被感染，該組的所有人就                      會被確定爲嫌疑人，而一個人可以在不同的組裏面，現在默認是0號同學爲嫌疑人，讓找出所有的嫌疑人。

輸入： n: 學生數量  m: 有幾組

輸出：嫌疑人數量

code：

#include<iostream>
#include<cstdio>
using namespace std;
const int maxn = 30005;

int n,m;
int pre[maxn];

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

int find(int x){
	
	int r = x,t;
	while(x!=pre[x])
       x = pre[x];
	while(r!=x){   "這部分是剪枝
	   t=pre[r];
	   pre[r] = x;
	   r=t;		
	}
    return  x;
}

void join(int x, int y)
{
	int fx=find(x), fy=find(y);
	if(fx!=fy)
	   pre[fx] = fy;
}

int main()
{
	int k;
	while(~scanf("%d%d",&n,&m)&&(n+m))
	{
		init();
		while(m--){
			cin>>k;
			int temp = 0,t,f=1;
			for(int i=0; i<k; i++){
             	 scanf("%d",&t);
             	 if(f)
             	 {
        	 	    f=0;
             	 }else{
             	 	join(temp,t);
             	 }             	 
             	 temp = t;
			}
        
		}
		int res = 0;
		for(int i=0;i <n ;i++)
		{
			if(find(i) == find(0))
			 res++;
		}
		printf("%d\n",res);
	}
	return 0;
}