POJ 2524 Ubiquitous Religions

There are so many different religions in the world today that it is difficult to keep track of them all. You are interested in finding out how many different religions students in your university believe in. 

You know that there are n students in your university (0 < n <= 50000). It is infeasible for you to ask every student their religious beliefs. Furthermore, many students are not comfortable expressing their beliefs. One way to avoid these problems is to ask m (0 <= m <= n(n-1)/2) pairs of students and ask them whether they believe in the same religion (e.g. they may know if they both attend the same church). From this data, you may not know what each person believes in, but you can get an idea of the upper bound of how many different religions can be possibly represented on campus. You may assume that each student subscribes to at most one religion.

The input consists of a number of cases. Each case starts with a line specifying the integers n and m. The next m lines each consists of two integers i and j, specifying that students i and j believe in the same religion. The students are numbered 1 to n. The end of input is specified by a line in which n = m = 0.

For each test case, print on a single line the case number (starting with 1) followed by the maximum number of different religions that the students in the university believe in.

10 9
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
10 4
2 3
4 5
4 8
5 8
0 0

Case 1: 1
Case 2: 7

Huge input, scanf is recommended.

题目大意：有n个人m个关系，每行输入的两个人表示有关系，若A与B有关系，B和C有关系则，A和C有关系。有关系的人为一组，求最多有多少组。

解题思路：裸并查集。

代码如下：

#include <cstdio>
const int maxn=50005;
int father[maxn];
int find (int x)
{
	return x==father[x]?x:father[x]=find(father[x]);
}
void Union(int a,int b)
{
	int a1=find(a);
	int b1=find(b);
	father[a1]=b1;
}

int main()
{
	int i,n,m,x,y,cnt,t=0;
	while(scanf("%d%d",&n,&m)!=EOF&&(n||m))
	{
		cnt=0;
		t++;
		for(i=0;i<n;i++)
			father[i]=i;
		for(i=0;i<m;i++)
		{
			scanf("%d%d",&x,&y);
			Union(x,y);
		}
		for(i=0;i<n;i++)
			if(find(i)==i)
				cnt++;
		printf("Case %d: %d\n",t,cnt );
	}
	return 0;
}