(并查集)Ubiquitous Religions
来源:互联网 发布:javascript字符串拼接 编辑:程序博客网 时间:2024/05/12 18:48
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
#include <iostream>#include <cstdio>using namespace std;int a[50010];int find(int x){ int r=x; while(r!=a[r]) { r=a[r]; } int i=x,j=r; while(i!=j) { j=a[i]; a[i]=r; i=j; } return r;}void merge(int x,int y){ int fx=find(x),fy=find(y); if(fx!=fy) { a[fx]=fy; }}int main(){ int n,m; int i,x,y,k=0; while(~scanf("%d%d",&n,&m)&&(n+m)) { k++; for(i=1;i<=n;i++) { a[i]=i; } for(i=1;i<=m;i++) { scanf("%d%d",&x,&y); merge(x,y); } int sum=0; for(i=1;i<=n;i++) { if(a[i]==i) { sum++; } } printf("Case %d: %d\n",k,sum); } return 0;}
0 0
- ubiquitous religions 并查集
- Ubiquitous Religions 并查集
- 并查集--Ubiquitous Religions
- 并查集 Ubiquitous Religions
- (并查集)Ubiquitous Religions
- Ubiquitous Religions -- 并查集
- PKU Ubiquitous Religions(并查集)
- POJ 2524 Ubiquitous Religions(并查集)
- POJ 2524-Ubiquitous Religions 并查集
- POJ2524 Ubiquitous Religions 并查集
- POJ 2524 Ubiquitous Religions 并查集
- poj 2524 Ubiquitous Religions(并查集)
- Ubiquitous Religions 简单并查集
- poj 2524 Ubiquitous Religions 并查集
- POJ 2524 Ubiquitous Religions (并查集)
- [poj 2524]Ubiquitous Religions[并查集]
- Ubiquitous Religions(并查集)
- poj 2524 - Ubiquitous Religions(并查集)
- ORACLE DUAL表详解 (转)
- Spinner
- 面试题——不用循环计算1+2+...+100之和
- 我的自白书
- RequireJs使用
- (并查集)Ubiquitous Religions
- Codevs 1288 埃及分数
- 转载《Oracle中NUMBER类型问题 》
- Linux平台下Python脚本编程入门(一)
- spring 控制反转
- 排查Full GC
- Apk反编译之晋江小说阅读
- Oracle11g无法登录DatabaseControl浏览器
- Hive学习笔记 --- 深入理解 HIVE 个各种存储模式