POJ 2524--Ubiquitous Religions (并查集)
2014-07-20 19:05
330 查看
Ubiquitous Religions
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
Sample Output
Hint
Huge input, scanf is recommended.
题意: 校长想了解在校生的宗教信仰,但是不好意思问,只知道X号学生与Y号学生的信仰是相同的,问,最多学校里有多少种信仰
cin >> n(在校生的人数) >> m(问到的学生的信仰关系相同的组数);
AC代码:
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 23335 | Accepted: 11503 |
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
Hint
Huge input, scanf is recommended.
题意: 校长想了解在校生的宗教信仰,但是不好意思问,只知道X号学生与Y号学生的信仰是相同的,问,最多学校里有多少种信仰
cin >> n(在校生的人数) >> m(问到的学生的信仰关系相同的组数);
AC代码:
#include<stdio.h> #include<iostream> using namespace std; int father[50005]; void hiti(int n) { for(int i = 0; i<=n ; i++) father[i] = i ; } int find(int x) { if(x != father[x]) father[x] = find(father[x]); return father[x]; } int main() { int n,m,i,x,y,cnt=0; while(1) { scanf("%d%d",&n,&m); cnt++; if(n==0&&m==0) break; hiti(n); for(i=1; i<=m; i++) { scanf("%d%d",&x,&y); int t1 = find(x); int t2 = find(y); if(t1 != t2) father[t1] = t2; } int ans = 0; for(i=1; i<=n; i++) if(father[i]==i) ans++; printf("Case %d: %d\n",cnt,ans); } return 0; }
相关文章推荐
- POJ 2524 Ubiquitous Religions(并查集)
- poj 2524_Ubiquitous Religions_并查集
- POJ 2524 Ubiquitous Religions【并查集模板】
- 并查集--POJ - 2524 Ubiquitous Religions
- POJ 2524 Ubiquitous Religions【并查集入门】
- poj 2524 并查集 入门
- POJ 2524 Ubiquitous Religions (并查集)
- Ubiquitous Religions(简单并查集 poj 2524 )
- POJ 2524 并查集
- poj 2524 Ubiquitous Religions [并查集]
- poj 2524(并查集-求连通子集的个数)
- POJ - 2524 Ubiquitous Religions(并查集)
- POJ2524 Ubiquitous Religions (并查集)
- POJ 2524 (并查集)
- Ubiquitous Religions POJ - 2524 ------并查集
- POJ 2524 宗教信仰 并查集 基础模板
- POJ 2524 Ubiquitous Religions (并查集)
- POJ 2524 并查集
- POJ 2524 Ubiquitous Religions 解题报告(并查集)
- poj 2524 并查集