POJ-2524 Ubiquitous Religions

1人阅读 评论(0) 收藏 举报
分类:

题目链接:点击打开链接

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.

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 9
1 2
1 3
1 4
1 5
1 6
1 7
1 8
1 9
1 10
10 4
2 3
4 5
4 8
5 8
0 0

Sample Output

Case 1: 1
Case 2: 7
思路:并查集裸题。 现在注意了初始化坑点。

AC代码:

#include<iostream>
#include<queue>
#include<algorithm>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cstdio>
#include<cstdlib>
#include<cctype>
#include<cstring>
using namespace std;
const int MAX = 50000;
const int INF = 0X3f3f3f;

int n, m;
int father[MAX];
int vis[MAX];//是否出现过

void init() {//初始化
    for(int i = 1; i <= n; i++) {
        father[i] = i;
        vis[i] = 0;
    }
}

int findfather(int x) {//路径压缩
    int a = x;
    while(x != father[x]) {
        x = father[x];
    }
    while(a != father[a]) {
        int z = a;
        a = father[a];
        father[z] = x;
    }
    return x;
}

void Union(int a, int b) { //合并
    int faA = findfather(a);
    int faB = findfather(b);
    if(faA != faB) {
        father[faA] = faB;
    }
}

int j = 1;
int main() {
    int u, v;
	while(scanf("%d %d", &n, &m) && n || m) {
        init();
        while(m--) {
            scanf("%d %d", &u, &v);
            vis[u] = 1, vis[v] = 1;
            Union(u, v);
        }
        int sum = 0, ans = 0;
        for(int i = 1; i <= n; i++) {
            if(vis[i] && father[i] == i) // 有几个集合
                sum++;
            if(!vis[i])//有几个未出现的人
                ans++;
        }
        int result = ans + sum;//结果
        printf("Case %d: %d\n", j++, result);
	}
	return 0;
}

查看评论

POJ Ubiquitous Religions

Language: Default Ubiquitous Religions Time Limit: 5000MS   Memory Limit: 65536K ...
  • R1986799047
  • R1986799047
  • 2015-03-21 22:07:21
  • 407

E - Ubiquitous Religions

A B C D E F E - Ubiquitous Religions Time Limit:5000MS     Memory Limit:65536KB     64bit IO F...
  • u013246297
  • u013246297
  • 2014-02-25 20:19:02
  • 331

Ubiquitous Religions POJ2524

Ubiquitous Religions Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 15...
  • tiantangrenjian
  • tiantangrenjian
  • 2011-12-19 16:33:03
  • 2553

poj-2524 Ubiquitous Religions

E - Ubiquitous Religions Time Limit:5000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I6...
  • u013067957
  • u013067957
  • 2014-02-25 19:58:48
  • 320

poj2524--Ubiquitous Religions

Ubiquitous Religions Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 22...
  • u013015642
  • u013015642
  • 2014-05-20 15:29:36
  • 379

poj-2524-Ubiquitous Religions

题目大意:一个学校有n人,其中有m对人是具有相同的宗教信仰, 问这个学校里信仰的宗教数最多有多少个。 解题思路:基础的并查集。具有相同信仰的人归为一个集合, 则最后的集合数量即为结果。求集合数量:...
  • u014004096
  • u014004096
  • 2014-09-02 19:36:23
  • 591

POJ-2524 Ubiquitous Religions【并查集】

1.思路分析 根据题意,统计所有人的宗教信仰,为集合操作,应使用并查集。 2.方法设计及性能衡量 实现并查集即可,计算合并后的集合数量。 3.实现部分 #include&amp...
  • tjj1998
  • tjj1998
  • 2017-10-13 19:33:19
  • 45

poj-2524 Ubiquitous Religions 并查集

题目 #include #include #include #include #include using namespace std; typedef long long LL;...
  • u011742541
  • u011742541
  • 2014-07-27 14:54:59
  • 276

E - Ubiquitous Religions(8.4.4)

E - Ubiquitous Religions(8.4.4) Time Limit:5000MS     Memory Limit:65536KB     64bit IO Format:%I64...
  • u013599426
  • u013599426
  • 2014-07-31 10:50:30
  • 303

B - Ubiquitous Religions

Description 当今世界有很多不同的宗教,很难通晓他们。你有兴趣找出在你的大学里有多少种不同的宗教信仰。 你知道在你的大学里有n个学生(0 < n ...
  • superxtong
  • superxtong
  • 2016-07-11 00:56:54
  • 257
    个人资料
    等级:
    访问量: 179
    积分: 241
    排名: 31万+
    文章存档
    最新评论