Ubiquitous Religions
来源:互联网 发布:xp网络连接图标不见了 编辑:程序博客网 时间:2024/06/03 18:03
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.
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.
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.
10 91 21 31 41 51 61 71 81 91 1010 42 34 54 85 80 0
Case 1: 1Case 2: 7
Huge input, scanf is recommended.
#include<cstdio>int find(int x);void pre(int x);void Union(int a,int b);int pn[50010];bool isRoot[50010];int main() {int n,m,i,ca;int a,b;ca=1;while(1){int cnt;cnt=0;scanf("%d%d",&n,&m);if(n==0&&m==0)break;pre(n);for(i=1;i<=m;i++){scanf("%d%d",&a,&b);Union(a,b);}for(i=1;i<=n;i++){isRoot[find(i)]=true;}for(i=1;i<=n;i++){if(isRoot[i]==true)cnt++;}printf("Case %d: %d\n",ca++,cnt);}return 0;}void pre(int x){int i;for(i=1;i<=x;i++){pn[i]=i;isRoot[i]=false;}}int find(int x){int r,z;r=x;while(r!=pn[r]){r=pn[r];}while(x!=pn[x]){z=x;x=pn[x];pn[z]=r;}return r;}void Union(int a,int b){int fa,fb;fa=find(a);fb=find(b);if(fa!=fb){pn[fb]=fa;}}并查集的模板题
阅读全文
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
- 综合收集
- TITAN引擎【0.1.0】版本发布
- 【几维安全】移动安全形势严峻:企业数字化转型,解决安全问题刻不容缓!
- 内外网同时使用静态路由设置
- maven常用命令以及下载的原理
- Ubiquitous Religions
- Swift 3.0
- python——sorted函数、sort函数以及operator.itemgetter的使用
- RabbitMq的整理 exchange、route、queue关系
- 题目列表
- Spring MVC如何接收浏览器传递来的请求参数--request--形参--实体类封装(类比Struts2模型驱动)
- matplotlib绘图实例:pyplot、pylab模块及作图参数
- Failed to load or instantiate TagLibraryValidator class
- bzoj1031[JSOI2007]字符加密Cipher(拆环变链,利用sa数组)