POJ Ubiquitous Religions
来源:互联网 发布:ubuntu wiki 编辑:程序博客网 时间:2024/06/07 06:34
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.
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.
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.
10 91 21 31 41 51 61 71 81 91 1010 42 34 54 85 80 0
Case 1: 1Case 2: 7
Huge input, scanf is recommended.
思路
基础的并查集应用 ,其中可以通过判断有几个根节点来判断有几个宗教(集合)
代码:
#include<stdio.h>
#define M 50000+10
int rank[M],pre[M];
void init(int n)
{
for(int i=0;i<n;i++)
{
pre[i]=i;
rank[i]=1;
}
}
int find(int x) // 也可以用递归
{
int r=x;
while(r!=pre[r])
{
r=pre[r];
}
int i=x;int j;
while(i!=r) // 路径压缩
{
j=pre[i];
pre[i]=r;
i=j;
}
return r;
}
void join(int x,int y)
{
x=find(x);
y=find(y);
if(x!=y)
{
pre[x]=y;
}
}
int main()
{
int n,m;int k=1;
while(scanf("%d%d",&n,&m)&&(n||m))
{
int num=0;
init(n);
for(int i=0;i<m;i++)
{
int a,b;
scanf("%d%d",&a,&b);
join(a,b);
}
for(int i=0;i<n;i++)
if(pre[i]==i) num++; // 因为 已经有路径压缩 不用 if(find(i)==i)
printf("Case %d: %d\n",k++,num);
}
return 0;
}
#define M 50000+10
int rank[M],pre[M];
void init(int n)
{
for(int i=0;i<n;i++)
{
pre[i]=i;
rank[i]=1;
}
}
int find(int x) // 也可以用递归
{
int r=x;
while(r!=pre[r])
{
r=pre[r];
}
int i=x;int j;
while(i!=r) // 路径压缩
{
j=pre[i];
pre[i]=r;
i=j;
}
return r;
}
void join(int x,int y)
{
x=find(x);
y=find(y);
if(x!=y)
{
pre[x]=y;
}
}
int main()
{
int n,m;int k=1;
while(scanf("%d%d",&n,&m)&&(n||m))
{
int num=0;
init(n);
for(int i=0;i<m;i++)
{
int a,b;
scanf("%d%d",&a,&b);
join(a,b);
}
for(int i=0;i<n;i++)
if(pre[i]==i) num++; // 因为 已经有路径压缩 不用 if(find(i)==i)
printf("Case %d: %d\n",k++,num);
}
return 0;
}
0 0
- POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- poj 2504 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
- 第一周:( LeetCode ) Best Time to Buy and Sell Stock I II III(c++)
- 开发语言之shell初接触二
- 基础-7 界面布局
- 基于Hexo+Node.js+github+coding搭建个人博客——进阶篇(从入门到入土)
- (第一人称)摄像机漫游脚本
- POJ Ubiquitous Religions
- Qt中获取CPU的序列号
- 记录一次因为Android版本不同导致的crash异常:Can't create handler inside thread that has not called Looper.prepare()
- osdv3工具的使用和程序的实现
- excel-java(3)
- 支持.swf格式的视频标签
- html中引入调用另一个html的方法
- python day2(20170221)
- Ionic 热更新