poj2524
来源:互联网 发布:ubuntu kqemu 编辑:程序博客网 时间:2024/05/21 09:27
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 30354 Accepted: 14709
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.
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 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
Case 1: 1
Case 2: 7
简单并查集
#include<iostream>#include<cstdio>using namespace std;typedef long long ll;int pre[50005];int n,m,cnt;void makeset(){ int i; for(i=1;i<=n;i++) pre[i]=i; cnt=n;}int find(int x){ if(x!=pre[x]) pre[x]=find(pre[x]); return pre[x];}void uniun(int x,int y){ int fx=find(x); int fy=find(y); if(fx!=fy){ pre[fy]=fx; cnt--; }}int main(){ ll cas=0; int i,j,k; while(scanf("%d%d",&n,&m)){ if(n==0&&m==0)break; makeset(); cas++; for(i=0;i<m;i++){ scanf("%d%d",&j,&k); uniun(j,k); } printf("Case %lld: %d\n",cas,cnt); } return 0;}
- poj2524
- poj2524
- POJ2524
- poj2524
- POJ2524
- poj2524
- poj2524
- [POJ2524]宗教
- poj2524 Ubiquitous Religions
- Ubiquitous Religions POJ2524
- poj2524解题报告
- POJ2524 Ubiquitous Religions
- POJ2524:Ubiquitous Religions
- poj2524 Ubiquitous Religions
- POJ2524(并查集)
- poj2524(并查集)
- POJ2524-并查集
- poj2524 Ubiquitous Religions
- 使用Fiddler自定义百度云分享提取码
- 答网友疑问:如何动态设置ItemControl的GroupStyle
- 《CLR via C#:框架设计》读书笔记 - 程序集加载和反射
- 我眼中的机器学习
- Js面向(基于)对象编程
- poj2524
- 《CLR via C#:框架设计》读书笔记 - 运行时序列化
- 什么是Docker?
- 《CLR via C#:框架设计》读书笔记 - 线程基础
- 使用Java调用ElasticSearch提供的相关API进行数据搜索完整实例演示
- redis 如何 把文件对象存进去
- HDU 1686 Oulipo
- 来自社区的Visual Studio Code使用体验和教程
- Andbase应用开发框架