Ubiquitous Religions
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 37218 | Accepted: 17728 |
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 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.
就是看用多少连通分量,用并查集很简单,再者如题所说最好用scanf
但是,但是,但是,我没用scanf,哈哈哈哈哈
#include<iostream>
using namespace std;
int f[50001];//记录每个点的祖先
int find(int x)//寻找该点的祖先
{
return x==f[x] ? x:find(f[x]);
}
void link(int x,int y)//连接
{
int fx=find(x);
int fy=find(y);
if(fx!=fy)//如果这两点祖先不同,连接起来
f[fx]=fy;
}
void init(int t)//初始化,方便以后判断
{
for(int i=1;i<=t;i++)
f[i]=i;
}
int main()
{
int m,n,a,b,count,flag=0;
while(cin>>n>>m)
{
flag++;
count=0;
if(n==0&&m==0) break;
init(n);
for(int i=0;i<m;i++)
{
cin>>a>>b;
link(a,b);
}
for(int i=1;i<=n;i++)
{
if(f[i]==i) count++;//相等说明这是一个连通分量的起点(最祖先)
}
cout<<"Case "<<flag<<':'<<' '<<count<<endl;
}
return 0;
}