POJ2524Ubiquitous Religions(并查集)
来源:互联网 发布:亳州淘宝教学 编辑:程序博客网 时间:2024/06/04 21:16
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 37298 Accepted: 17772
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<cstring>using namespace std;int father[50005];int n,m;int find(int i){ while(i!=father[i]) i=father[i]; return i;}void merge(int a,int b){ int fa=find(a); int fb=find(b); if(fa!=fb) father[fa]=fb;}int main(){ int count,num=0; int x,y; while(scanf("%d %d",&n,&m)!=EOF&&n!=0&&m!=0) { num++; memset(father,0,sizeof(father)); for(int i=1;i<=n;i++) father[i]=i; for(int i=1;i<=m;i++) { scanf("%d %d",&x,&y); merge(x,y); } count=0; for(int i=1;i<=n;i++) { if(father[i]==i) count++; } printf("Case %d: %d\n",num,count); } return 0;}
阅读全文
0 0
- POJ2524Ubiquitous Religions(并查集)
- POJ2524Ubiquitous Religions(并查集)
- POJ2524Ubiquitous Religions [数据结构-并查集 union-find sets]
- poj2524Ubiquitous Religions
- POJ2524Ubiquitous Religions
- PKU Ubiquitous Religions(并查集)
- Ubiquitous Religions(并查集)
- (并查集入门)Ubiquitous Religions
- POJ Ubiquitous Religions (并查集)
- Ubiquitous Religions(并查集)
- POJ2524--Ubiquitous Religions(并查集)
- Ubiquitous Religions (简单并查集)
- ubiquitous religions 并查集
- 【并查集】Ubiquitou Religions
- Ubiquitous Religions 并查集
- 并查集--Ubiquitous Religions
- 并查集 Ubiquitous Religions
- (并查集)Ubiquitous Religions
- MySQL数据库删除用户报错:ERROR 1054 (42S22): Unknown column 'User' in 'where clause'
- 计算机核心期排名
- kubernetes1.5.2--部署DNS服务
- Python3使用百度地图API实现地点信息转换
- [Sonar][WARNING] Error injecting: org.sonarsource.scanner.maven.SonarQubeMojo
- POJ2524Ubiquitous Religions(并查集)
- leetcode268. Missing Number
- 数组冒泡排序
- eclipse maven项目查阅源码
- 面试题--01
- Python3模块详解--老司机工具urllib模块详解之urllib.parse子模块
- 目标检测的图像特征提取之(二)LBP特征
- JD2715 忠诚2——线段树(线段树裸题)
- CentOS6.5 中安装单机版redis