POJ 2524 Ubiquitous Religions
来源:互联网 发布:背锅侠网络意思 编辑:程序博客网 时间:2024/05/16 09:56
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 24168 Accepted: 11916
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.
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 91 21 31 41 51 61 71 81 91 1010 42 34 54 85 80 0
Sample Output
Case 1: 1Case 2: 7
Hint
Huge input, scanf is recommended.
#include<cstdio>
#include<iostream>#include<algorithm>
using namespace std;
int par[50010],son[50010];
int find(int x){return x==par[x]?x:find(par[x]);}
void join(int x,int y)
{
int a=find(x);
int b=find(y);
if(a!=b){
par[a]=b;
son[b]+=son[a];
}
}
int main()
{
int n,m,k=0;
while(scanf("%d%d",&n,&m)!=EOF&&m||n){
for(int i=1;i<=n;i++){
par[i]=i;son[i]=1;
}
for(int i=0;i<m;i++){
int a,b;
scanf("%d%d",&a,&b);
join(a,b);
}
int count=0;
for(int i=1;i<=n;i++){
if(par[i]==i){count++;}
}
printf("Case %d: %d\n",++k,count);
}
return 0;
}
0 0
- POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- POJ-2524 Ubiquitous Religions
- Poj 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 - Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- POJ-2524-Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- Java JDK8 Windows XP安装与“无... RegDeleteKeyExA 于... ADVAPI32.dll”的解决
- pdf转换成excel转换器怎么用
- 单例模式的七种写法
- neu1458 方格取数 dp解法
- CodeForces 69D Dot (博弈+记忆化)
- POJ 2524 Ubiquitous Religions
- perl解析语法
- JSF中h:message 和h:messages 的区别
- HDU 1003 Max Sum(dp,最大连续子序列和)
- mysql 连接报错:Host is blocked because of many connection errors; unblock with 'mysqladmin flush-h
- PowerDesigner连接MySQL,建立逆向工程图解
- 01背包问题
- Cocos2d-x is not thread-safe
- C++ 虚函数表解析