# POJ2524_并查集

 Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 12171 Accepted: 5759

Description

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.

Input

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.

Output

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


Hint

Huge input, scanf is recommended.
#include <iostream>
#include <cstdio>
#include <cstring>

using namespace std;

#define MAXN 50000
class UFS{
public:
UFS(){
memset(p,0,sizeof(p));
memset(rank,0,sizeof(rank));
}
void Make_Set(int x){
p[x] = x;
rank[x] = 0;
}
void Union(int x, int y){
}
if(rank[x] > rank[y]){
p[y] = x;
}
else{
p[x] = y;
if(rank[x] == rank[y])
rank[y]++;
}
}
int Find_Set(int x){
if(p[x]!=x)
p[x] = Find_Set(p[x]);
return p[x];
}
private:
int p[MAXN+4];
int rank[MAXN+4];
};

//#define UNSUBMTI
int main()
{
#ifdef UNSUBMTI
freopen("data.in","r",stdin);
freopen("data.out","w",stdout);
#endif
int m,n;
int j,k;
int t = 0;					//测试数据的组数
int count;					//the number of religion
UFS * religion = new UFS();
while(scanf("%d%d",&n,&m)==2 && (n||m)!=0)
{
count = n;
++t;
for(int i=1; i<=n; i++)
religion->Make_Set(i);
for(int i=1; i<=m; i++){
scanf("%d%d",&j,&k);
religion->Union(j,k);
}
for(int i=1; i<=n; i++){
if(religion->Find_Set(i)!=i)
count--;
}
printf("Case %d: %d\n",t,count);
}
return 0;
}

#### poj2524_并查集基础

2014-03-12 01:09:09

#### acm的数据结构内容

2010年04月23日 408KB 下载

#### 并查集模板

2018年06月24日 1KB 下载

#### 并查集的基本应用，一个基本程序代码

2010年06月08日 1KB 下载

#### 并查集详解 ——图文解说,简单易懂(转)

2016-03-10 17:38:08

#### 并查集的几道题目

2015-08-11 16:06:38

#### 并查集拓展和技巧（题目集）

2016-10-10 16:02:51

#### 朱全民-并查集ppt

2009年07月25日 103KB 下载

#### 并查集（模板&典型例题整理）

2017-04-13 21:15:05

#### 【模版】并查集 及路径压缩

2014-08-19 15:10:40