Ubiquitous Religions(friends变形)
来源:互联网 发布:禾赛科技 知乎 编辑:程序博客网 时间:2024/05/17 00:10
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 <iostream>#include <algorithm> using namespace std;int p[60000],c[60000];int find(int x){return p[x]==x ? x : p[x]=find(p[x]);}int main(){ int t=1,i,x,y;int m,n; while(cin>>m>>n,m!=0)
{ for(i=1;i<=m;i++) {p[i]=i;c[i]=0;} for(i=1;i<=n;i++) { cin>>x>>y; x=find(x); y=find(y); if(x!=y) p[x]=y; } for(i=1;i<=m;i++) {x=find(i); c[i]=x; }
sort(c,c+m);
int max=1; for(int i=2; i<=m; i++) if(c[i]!=c[i-1]) max++;
cout<<"Case "<<t<<": "<<max<<endl; t++; } return 0;}
0 0
- Ubiquitous Religions(friends变形)
- 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
- 关于内存的分类
- 五大常用算法之四:回溯法
- stb页面显示性能优化
- android初学------身份证验证
- php实现数字签名
- Ubiquitous Religions(friends变形)
- Block块快速枚举
- Fitle App-网购达人的福音
- Logistic Regression 分类算法
- Android开发使用GET方式向服务器请求和发送数据
- 五大常用算法之五:分支限界法
- 在使用Myeclipse项目转成eclipse时出现java.lang.NoClassDefFoundError:EDU错误的解决方案
- 手机格式化了图片怎么恢复
- hdu 2426 Interesting Housing Problem (KM算法)