Ubiquitous Religions
来源:互联网 发布:哪些排序算法不稳定 编辑:程序博客网 时间:2024/06/06 15:00
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 26678 Accepted: 13127
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训练上是分治法,但我的第一感觉是并查集,所以先写并查集,以后再补分治#include <cctype>#include <cstdio>#include <cmath>#include <cstring>#include <cstdlib>#include <iostream>using namespace std;const int Max=50010;int pre[Max];int find(int x){ int i=x,r=x,j; while(pre[r]!=r) { r=pre[r]; } while(pre[i]!=i)//压缩路径 { j=pre[i]; pre[i]=r; i=j; } return r;}void Build(int x,int y){ int fx=find(x); int fy=find(y); if(fx!=fy) { pre[fx]=fy; }}int main(){ int n,m; int x,y; int w=1; while(scanf("%d %d",&n,&m)) { if(n==0&&m==0) { break; } for(int i=1;i<=n;i++) { pre[i]=i; } while(m--) { scanf("%d %d",&x,&y); Build(x,y); } int sum=0; for(int i=1;i<=n;i++) { if(pre[i]==i) { sum++; } } printf("Case %d: %d\n",w++,sum); } 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
- Hadoop安装配置(棒极了,每一小步都写得非常清楚)
- 第二题
- FireDAC 下的 Sqlite [9] - 关于排序
- 一个程序员工作一年来收藏的网站 .
- spring-boot 加载本地静态资源文件路径配置
- Ubiquitous Religions
- android 使用DigestUtilsmd5加密
- js中(function(){…})()立即执行函数写法理解
- win7下开启FTP服务
- FireDAC 下的 Sqlite [10] - 使用 R-Tree 搜索
- 第八章习题汇总
- WinForm实现鼠标悬停显示控件
- Theano2.1.7-基础知识之设置的配置和编译模式
- 算法