pokerG

HOJ 2033 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 nand 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.

Sample Input 

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
Sample Output 
Case 1: 1
Case 2: 7
Author: Howard Cheng

题解：

             并查集，判断有多少个祖先，用一个数组记录访问状态即可。 


#include <cstdio>
#include <cstdlib>
#include <cstring>
int set[50005];
bool vis[50005];
int findset(int x){
	if(x == set[x])
	   return x;
	set[x] = findset(set[x]);
	return set[x];
}
int main(){
	int n,m;
	int cases = 0;
	while(scanf("%d%d",&n,&m) && n && m){
		cases ++;
		for(int i = 1; i <= n; i++)
			set[i] = i;
	        int fx,fy;
	        for(int i = 1; i <= m; i++){
		        scanf("%d%d",&fx,&fy);
		        fx = findset(fx);
		        fy = findset(fy);
		        if(fx < fy)
			     set[fy] = fx;
		        else
			     set[fx] = fy;
		}
	        memset(vis,false,sizeof(vis));
	        int res = 0;
	        for(int i = 1; i <= n; i++){
		         if(vis[findset(i)] == false){
                     res ++;
		             vis[findset(i)] = true;
			 }
		}
                printf("Case %d: %d\n",cases,res);
	}
        return 0;
}





blog comments powered by Disqus

Published

2013-04-09

Categories


Tags