Fork me on GitHub

POJ 2524 Ubiquitous Religions (并查集)

题目

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 \leq
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 \leq m \leq \frac{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

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
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

1
2
Case 1: 1
Case 2: 7

Hint

Huge input, scanf is recommended.


#分析
并查集模板题,不多说,直接上代码


代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<cstdlib>
#include<functional>
#include<climits>
#include<cctype>
#include<iomanip>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define mod 1e9+7
#define clr(a,x) memset(a,x,sizeof(a))
const double eps = 1e-6;
int religion[1000000];
int find(int a)
{
if(religion[a]!=a)
religion[a]=find(religion[a]);
return religion[a];
}
void merge(int a,int b)
{
int fx,fy;
fx=find(a);
fy=find(b);
if(fx!=fy)
religion[fx]=fy;
}
int main()
{
int a,b;
int t,n;
int kase=0;
while(scanf("%d%d",&t,&n)==2,t+n)
{
int cnt=0;
clr(religion,0);
for(int i=1;i<=t;i++)
{
religion[i]=i;
}
for(int i=0;i<n;i++)
{
scanf("%d%d",&a,&b);
merge(a,b);
}
for(int i=1;i<=t;i++)
{
if(find(i)==i)
cnt++;
}
printf("Case %d: %d\n",++kase,cnt);
}
return 0;
}
-------------本文结束感谢您的阅读-------------
obsidian wechat
欢迎您扫一扫上面的微信公众号,订阅我的博客!
坚持原创技术分享,您的支持是我最大的动力!