[POJ](2524)Ubiquitous Religions ---- 并查集
来源:互联网 发布:软件 程序员 编写 编辑:程序博客网 时间:2024/05/20 00: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.
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.
题意:
让你求这个无向图的连通分量的个数
思路与新知:
思路:
并查集可以求连通分量的个数! 判断 if(fa[i] == i) 即可
新知:
看来在大量输入输出面前,还是scanf比加速外挂效率高啊~
加速外挂:
scanf和printf:
AC代码:
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int MAX = 50005;int fa[MAX];int Find(int x){ return x == fa[x]?x:fa[x] = Find(fa[x]);}void Union(int x,int y){ int a = Find(x),b=Find(y); if(a!=b) fa[a] = b;}int main(){ int n,m; int c = 1; while(~scanf("%d %d",&n,&m)) { int ans = 0; if(n==0 && m == 0) break; for(int i=1;i<=n;i++) fa[i] = i; int x,y; for(int i=0;i<m;i++) { scanf("%d %d",&x,&y); Union(x,y); } for(int i=1;i<=n;i++) { if(i == fa[i]) ans++; } printf("Case %d: %d\n",c++,ans); } return 0;}
- POJ 2524 Ubiquitous Religions(并查集)
- POJ 2524-Ubiquitous Religions 并查集
- POJ 2524 Ubiquitous Religions 并查集
- poj 2524 Ubiquitous Religions(并查集)
- poj 2524 Ubiquitous Religions 并查集
- POJ 2524 Ubiquitous Religions (并查集)
- [poj 2524]Ubiquitous Religions[并查集]
- poj 2524 - Ubiquitous Religions(并查集)
- POJ 2524 Ubiquitous Religions (并查集)
- [并查集]POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions 并查集
- poj 2524 Ubiquitous Religions --- 并查集
- POJ 2524 Ubiquitous Religions(并查集)
- POJ-2524 Ubiquitous Religions 并查集
- poj 2524 Ubiquitous Religions(并查集)
- poj 2524 Ubiquitous Religions(并查集)
- POJ 2524 Ubiquitous Religions (并查集)
- POJ 2524 Ubiquitous Religions 并查集
- PID控制的MATLAB仿真(1)
- 0.96寸OLED屏使用详解
- stomp over websocket协议原理与实现
- oracle基础
- 一张图理解String字符串
- [POJ](2524)Ubiquitous Religions ---- 并查集
- Kubernetes最小集群配置
- ARM 嵌入式微处理器指令集(下)
- 基于JSON+JQuery实现的多条件筛选功能(类似京东和淘宝功能)
- C# (ref)值传递转成引用传递
- Docker 加速
- C/C++_关于rand()和srand()的调用方式的一点探究
- 生成 软连接、硬连接 是通过命令行操作的
- spark小结