poj2524 Ubiquitous Religions
来源:互联网 发布:淘宝客服怎么做流程图 编辑:程序博客网 时间:2024/05/09 10:49
Language:
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536K
Total Submissions: 30365 Accepted: 14715
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
Hint
Huge input, scanf is recommended.
Source
Alberta Collegiate Programming Contest 2003.10.18
并查集复习第二题。
这道题比上一道题简单。
把每两个学生连边,最后求不在并查集里的学生个数。
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#define N 50010using namespace std;int n, m, f[N], ans, T;inline int read(){ int x = 0, f = 1; char ch = getchar(); while (ch < '0' || ch > '9') { if (ch == '-') f = -1; ch = getchar(); } while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); } return x * f;}int find(int x){ if(f[x] == x) return x; return f[x] = find(f[x]);}int main(){ n = read(); m = read(); while(n != 0 && m != 0) { T ++; for(int i = 1; i <= n; i ++) f[i] = i; ans = n; while(m --) { int x, y; x = read(); y = read(); int u = find(x); int v = find(y); if(u == v) continue; ans --; f[v] = u; } printf("Case %d: %d\n", T, ans); n = read(); m = read(); } return 0;}
- poj2524 Ubiquitous Religions
- Ubiquitous Religions POJ2524
- POJ2524 Ubiquitous Religions
- POJ2524:Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524--Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- POJ2524,Ubiquitous Religions
- poj2524--Ubiquitous Religions
- POJ2524--Ubiquitous Religions
- 【POJ2524】Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- Android 读取网络数据
- [参考]redis存储商品信息,自增订单或商品id,缓存评论!
- java毕向东听课笔记23(集合框架-List集合具体对象)
- LeetCode208 Implement Trie (Prefix Tree) Java
- JSP基础
- poj2524 Ubiquitous Religions
- 【证明可用】Ubuntu14.04/16.04命令行快速安装Ruby和Rails运行环境
- Wiki
- 【BFS】初探
- Android 使用HttpGet进行登录
- JAVA动态规划(四)--根据给定0和1的个数,求字典序排在第K位的数【微软笔试题】
- 事件的添加,触发,删除
- spark源码阅读笔记RDD(二)RDD子类基本方法和信息
- 全民枪战玩法介绍 全民枪战优缺点分析