zoj 2524 并查集裸
2024-08-29 00:42:42
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.
#include <iostream>
#include <cstdio>
#include <algorithm> using namespace std; const int maxn=+;
int f[maxn];
int find(int x) {
return f[x]==x?x:f[x]=find(f[x]);
}
void init(int x) {
for(int i=;i<=x;i++) f[i]=i;
}
void merge(int x,int y) {
int a=find(x);
int b=find(y);
if(a!=b) f[a]=b;
}
int main() {
// freopen("input.txt","r",stdin);
int n,m;
int cas=;
while(scanf("%d%d",&n,&m)!=EOF) {
init(n);
if(n==&&m==) break;
for(int i=;i<=m;i++) {
int a,b;
scanf("%d%d",&a,&b);
merge(a,b);
}
int ans=;
for(int i=;i<=n;i++) {
if(f[i]==i) ans++;
}
printf("Case %d: %d\n",cas++,ans);
}
return ;
}
最新文章
- 内嵌iframe
- 用js判断页面刷新或关闭的方法
- objective-c可变字典
- Ubuntu设置squid代理
- Hash Table构建
- log4Net配置详解
- pyqt颜色字符
- 【LeetCode】91. Decode Ways
- localStorage sessionStorage 和cookie等前端存储方式总结
- 【转】我读过最好的epoll讲解(来自知乎)
- rpm 相关问题
- C-static,auto,register,volatile
- 按固定元素数目分割数组- perl,python
- FZU - 1901 Period II(kmp所有循环节)
- BI怎么选?重点看这10个技术指标
- 使用bat文件执行sql文件
- PyQt—QTableWidget实现翻页功能
- MyBatis 实现新增
- 谈谈对Python装饰器的理解
- 使用tensorflow的lstm网络进行时间序列预测