poj 2524 Ubiquitous Religions
来源:互联网 发布:象棋奇兵软件下载 编辑:程序博客网 时间:2024/06/12 00:51
Ubiquitous Religions
Time Limit: 5000MS Memory Limit: 65536KTotal Submissions: 31780 Accepted: 15410
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
Hint
Huge input, scanf is recommended.
终于见着一个水题了哈哈
这题就是一个并查集的简单题
#include <stdio.h>
int a[1000002];
int find(int x)
{
while(a[x] != x)
{
x = a[x];
}
return x;
}
void meget(int x,int y)
{
int fx = find(x);
int fy = find(y);
if(fx != fy)
{
a[fx] = fy;
}
}
int main()
{
int n,m,i,j;
int x,y;
int w = 1;
while(~scanf("%d %d",&n,&m)&&(n != 0&&m != 0))
{
for(i = 1;i <= n; i++)
{
a[i] = i;
}
for(i = 0;i < m; i++)
{
scanf("%d %d",&x,&y);
meget(x,y);
}
int sum = 0;
for(i = 1;i <= n; i++)
{
if(a[i] == i)
{
sum++;
}
}
printf("Case %d: %d\n",w,sum);
w++;
}
}
int a[1000002];
int find(int x)
{
while(a[x] != x)
{
x = a[x];
}
return x;
}
void meget(int x,int y)
{
int fx = find(x);
int fy = find(y);
if(fx != fy)
{
a[fx] = fy;
}
}
int main()
{
int n,m,i,j;
int x,y;
int w = 1;
while(~scanf("%d %d",&n,&m)&&(n != 0&&m != 0))
{
for(i = 1;i <= n; i++)
{
a[i] = i;
}
for(i = 0;i < m; i++)
{
scanf("%d %d",&x,&y);
meget(x,y);
}
int sum = 0;
for(i = 1;i <= n; i++)
{
if(a[i] == i)
{
sum++;
}
}
printf("Case %d: %d\n",w,sum);
w++;
}
}
代码菜鸟,如有错误,请多包涵!!
0 0
- POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- POJ-2524 Ubiquitous Religions
- Poj 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 - Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- poj 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- POJ-2524-Ubiquitous Religions
- POJ 2524 Ubiquitous Religions
- row, merge,displayalerts:获取行数,合并,提示框
- HDU 5547 Sudoku ( 非DFS,利用数独思路来搞 )
- jmter各路好文
- [RabbitMQ+Python入门经典] 兔子和兔子窝
- Scrapy安装、爬虫入门教程、爬虫实例(豆瓣电影爬虫)
- poj 2524 Ubiquitous Religions
- 内排序-选择类排序-简单选择排序
- Android LCD(四):LCD驱动调试篇
- ORACLE 函数sys_guid()与sequence区别
- 双向链表习题(牛客网习题)
- 水平recyclerview实现翻页效果
- 密码
- Android录音器
- EL表达式