POJ2524:Ubiquitous Religions
来源:互联网 发布:mac mini怎么接显示器 编辑:程序博客网 时间:2024/06/05 08:22
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
每Union一下,信仰宗教数就减一
领完并差集代表元素的前一个元素为负值,且其值为并差集中元素个数。
<pre name="code" class="html">#include<iostream>#include<cstring>using namespace std;int pre[100004];int cnt;int n,m;int find(int x){int r=x;while(pre[r]>0){r=pre[r];}/*while(x!=r){int j=pre[x];pre[j]=r;x=pre[x];}*/return r;}/*void union_set(int x,int y){int tx=find(x);int ty=find(y);if(tx==ty)return ;pre[x]=pre[x]+pre[y];pre[y]=x;n--; }*/ /*void makeSet(){for(int i=1;i<=n;i++)pre[i]=-1; }*/int main(){while(cin>>n>>m,n){//makeSet();memset(pre,-1,sizeof(pre));cnt++;int x,y;while(m--){cin>>x>>y;//union_set(x,y);int tx=find(x);int ty=find(y);if(tx!=ty){pre[tx]=pre[tx]+pre[ty];pre[ty]=tx;n--; } }cout<<"Case "<<cnt<<": "<<n<<endl;}return 0; }
0 0
- poj2524 Ubiquitous Religions
- Ubiquitous Religions POJ2524
- POJ2524 Ubiquitous Religions
- POJ2524:Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524--Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- POJ2524,Ubiquitous Religions
- poj2524--Ubiquitous Religions
- POJ2524--Ubiquitous Religions
- 【POJ2524】Ubiquitous Religions
- POJ2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- poj2524 Ubiquitous Religions
- 您在什么情况下会用到虚方法?它与接口有什么不同?
- 对象小结
- 使用iperf工具测试infiniband的速度
- OpenCV中Mat的详解
- java遍历二叉树组
- POJ2524:Ubiquitous Religions
- 重载小结
- Java提高篇之TreeMap
- 处于不同栈Activity之间的启动与数据传递
- Androud中的Http通信之WebView
- TCP的流量控制和拥塞控制
- POJ 1006
- opencv中Mat的赋值和访问(一)
- 学习日记20160913