寒假训练--并查集--Ubiquitous Religions
来源:互联网 发布:詹姆斯首秀数据 编辑:程序博客网 时间:2024/05/07 11:54
Ubiquitous Religions
Time Limit: 1000MS Memory limit: 65536K
题目描述
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.
输入
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
提示
来源
示例程序#include <stdio.h>int p[50001] ;int f(int x){ while(x != p[x]) x = p[x] ; return x ;}void get(int u,int v){ u = f(u); v = f(v); if(u != v) p[u] = p[v] ;}int main(){ int n , m , i , num , u , v , cou = 0 ; while(scanf("%d %d", &n, &m)!=EOF) { cou++; if(n==0 && m==0) break; for(i = 1 ; i <= n ; i++) p[i] = i ; for(i = 1 ; i <= m ; i++) { scanf("%d %d", &u,&v); get(u,v); } num = 0 ; for(i = 1 ; i <= n ; i++) if(p[i] == i) num++; printf("Case %d: %d\n", cou, num); }}
0 0
- 寒假训练--并查集--Ubiquitous Religions
- 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(并查集)
- dbutils开源项目用法
- OCP-1Z0-053-V13.02-450题
- sysfs文件系统对象sysfs_dirent的基本关系图
- Android设置应用手机屏幕启动流程(一)
- 数据质量
- 寒假训练--并查集--Ubiquitous Religions
- C++的4种类型转换关键字及其特点
- C - 01背包
- hmap理解
- zend studio 配thinkphp框架学习笔记
- toad及pl/sql使用Oracle instant client访问数据库
- 当执行[object selector:para]的时候,发生了什么?
- bind1nd,not1,compose1等用法
- Android平台按键消息处理流程一(Android4.2.2)