POJ 2524 Ubiquitous Religions (幷查集)
来源:互联网 发布:好喝的白酒推荐知乎 编辑:程序博客网 时间:2024/06/08 13:45
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 23090 Accepted: 11378
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.
Source
Alberta Collegiate Programming Contest 2003.10.18
#include <iostream>
#include <cstdio>
using namespace std;
int f[50005],sum;
#include <cstdio>
using namespace std;
int f[50005],sum;
//查找x的父节点,如果f[x]==x,他的父节点就是本身。
int find (int x)
{
if(f[x]!=x)
f[x]=find(f[x]);
return f[x];
}
int find (int x)
{
if(f[x]!=x)
f[x]=find(f[x]);
return f[x];
}
//如果不是一个集合(父节点不相同),合并集合(将父节点改成b的父节点)。
void make(int a,int b)
{
int f1=find(a);
int f2=find(b);
if(f1!=f2)
{
f[f2]=f1;
sum--; //宗教数减一。
}
}
int main()
{
int n,m,p=1,i;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(n==0&&m==0) break;
for(i=1;i<=n;i++)
f[i]=i;
sum=n;
for(i=1;i<=m;i++)
{
int a,b;
scanf("%d%d",&a,&b);
make(a,b);
}
printf("Case %d: %d\n",p++,sum);
}
return 0;
}
void make(int a,int b)
{
int f1=find(a);
int f2=find(b);
if(f1!=f2)
{
f[f2]=f1;
sum--; //宗教数减一。
}
}
int main()
{
int n,m,p=1,i;
while(scanf("%d%d",&n,&m)!=EOF)
{
if(n==0&&m==0) break;
for(i=1;i<=n;i++)
f[i]=i;
sum=n;
for(i=1;i<=m;i++)
{
int a,b;
scanf("%d%d",&a,&b);
make(a,b);
}
printf("Case %d: %d\n",p++,sum);
}
return 0;
}
1 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
- Error injecting constructor, java.net.UnknownHostException: *****
- HDU 1385 Minimum Transport Cost (最短路+记录路径+字典序)
- 华为机试整理
- 排列
- 我的照片被涂鸦了怎么恢复
- POJ 2524 Ubiquitous Religions (幷查集)
- Android中RelativeLayout各个属性的含义
- 算法竞赛入门经典(第2版)习题3-12 浮点数 Floating-Point Numbers UVa11809
- MyEclipse里WEB-INF显示classes附Web开发目录结构
- 加沙问题的相关概念
- 彻底搞懂oracle的标量子查询
- 集群、分布式计算、负载均衡的区别
- 使用ngrok快速地将本地Web服务映射到外网
- mybatis对数字的处理