Ubiquitous Religions
来源:互联网 发布:万方数据库的检索途径 编辑:程序博客网 时间:2024/06/01 08:36
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 32338 Accepted: 15675
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
Alberta Collegiate Programming Contest 2003.10.18
#include<iostream>using namespace std;int s[100005];int judge(int e){while( e != s[e]){e = s[e];}return e;}int main(){int n,m,a,b;int k = 1;while(cin >> n >> m, n||m){int num = 0;int x,y;for(int i = 1;i <= n;i++){s[i] = i;}for(int i = 1;i <= m;i++){cin >> a >> b;x = judge(a);y = judge(b);if(x != y)s[x] = y;}for(int i = 1;i <= n;i++){if(s[i] == i){cout << s[i] << " ";num++;}}cout << "Case " << k++ << ": " << num << endl;}return 0;}
0 0
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- Ubiquitous Religions
- CentOS 7 安装xrdp 远程桌面
- Visual Recognition 课程材料
- MySQL函数总结
- 给下拉框设置只读
- 使用List<实体对象>来自定义适配器
- Ubiquitous Religions
- Controller接口控制器(3)
- 复杂类型声明
- C语言数组疑难杂症一次根除
- AngularJS 之 Factory vs Service vs Provider
- Swift 3.0 生成二维码图片
- static作用:静态变量的生存周期和作用域
- linux 传输不需要密码
- Controller接口控制器(4)