Ubiquitous Religions (简单并查集)
来源:互联网 发布:变声器玩游戏知乎 编辑:程序博客网 时间:2024/05/19 15:40
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 36635 Accepted: 17464
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
这题也是简单的并查集,比如1 2那么1 和2 是一个宗教,2 3就是2和3一个,当然1 2 3属于同一个宗教 ;
最后判断宗教的个数;
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=101000;
int par[N];
void init(int n)
{
for(int i=0;i<=n;i++)
{
par[i]=i;
}
}
int find(int x)
{
if(par[x]==x) return x;
return par[x]=find(par[x]);
}
void unite(int x,int y)
{
x=find(x);y=find(y);
par[y]=x;
}
bool same(int x,int y)
{
return find(x)==find(y);
}
int n,m;
int main()
{
int k=1;
while(scanf("%d %d",&n,&m),n||m)
{
init(n);
while(m--)
{
int a,b;
scanf("%d %d",&a,&b);
if(a>b) swap(a,b);
if(!same(a,b))
{
unite(a,b);
}
}
int i,d=0;
for(i=1;i<=n;i++)
{
if(par[i]==i) d++;
}
printf("Case %d: %d\n",k++,d);
}
return 0;
}
#include<algorithm>
#include<cstdio>
using namespace std;
const int N=101000;
int par[N];
void init(int n)
{
for(int i=0;i<=n;i++)
{
par[i]=i;
}
}
int find(int x)
{
if(par[x]==x) return x;
return par[x]=find(par[x]);
}
void unite(int x,int y)
{
x=find(x);y=find(y);
par[y]=x;
}
bool same(int x,int y)
{
return find(x)==find(y);
}
int n,m;
int main()
{
int k=1;
while(scanf("%d %d",&n,&m),n||m)
{
init(n);
while(m--)
{
int a,b;
scanf("%d %d",&a,&b);
if(a>b) swap(a,b);
if(!same(a,b))
{
unite(a,b);
}
}
int i,d=0;
for(i=1;i<=n;i++)
{
if(par[i]==i) d++;
}
printf("Case %d: %d\n",k++,d);
}
return 0;
}
人一我百!人十我万!永不放弃~~~怀着自信的心,去追逐梦想。
阅读全文
0 0
- Ubiquitous Religions (简单并查集)
- Ubiquitous Religions 简单并查集
- POJ2524 Ubiquitous Religions(简单并查集)
- POJ 2524 Ubiquitous Religions(简单的并查集)
- POJ - 2524 Ubiquitous Religions(简单并查集)
- POJ 2524 Ubiquitous Religions(简单并查集)
- PKU Ubiquitous Religions(并查集)
- Ubiquitous Religions(并查集)
- (并查集入门)Ubiquitous Religions
- POJ Ubiquitous Religions (并查集)
- Ubiquitous Religions(并查集)
- POJ2524--Ubiquitous Religions(并查集)
- ubiquitous religions 并查集
- Ubiquitous Religions 并查集
- 并查集--Ubiquitous Religions
- 并查集 Ubiquitous Religions
- (并查集)Ubiquitous Religions
- Ubiquitous Religions -- 并查集
- 【系统测试】性能测试总结
- 双磁盘安装win10和centos 7之后的一些配置工作
- RTTI学习笔记
- js兼容性
- 多线程问题汇总
- Ubiquitous Religions (简单并查集)
- Yii (1.1)调用数据库
- jq绑定事件方法及区别
- Ubuntu上使用gensim计算文档间的相似度
- 常见的垃圾收集器
- HDU 1806 Frequent values(线段树+离散化+二分)
- vector用法
- hibernate整合spring异常处理
- AudioService