POJ---2524 Ubiquitous Religions【并查集】

        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

SOURCE：点击打开链接

题意：

    学校中有n名学生，编号为1到m，你可以询问其中m组同学他们的宗教信仰，看看是否相同，最终求出学校中最多有多少种宗教

题解：

    典型并查集

代码：

#include <iostream>
#define maxn 50005
using namespace std;
int par[maxn],vis[maxn],rank[maxn];//vis数组用来标记，rank数组用来记录树的高度
int find(int x);
void unite(int x,int y);
int main()
{
    int n,m,a,b;
    int cas=1;
    while(cin>>n>>m)
    {
        if(n==0&&m==0)
            break;
        for(int i=1;i<=n;i++)
        {
            par[i]=i;
            rank[i]=vis[i]=0;//初始时各个树的高度均为0
        }
        for(int i=1;i<=m;i++)
        {
            cin>>a>>b;
            unite(a,b);//将a和b联系起来
        }
        for(int i=1;i<=n;i++)
            vis[find(i)]++;
        int sum=0;
        for(int i=1;i<=n;i++)
        {
            if(vis[i])
                sum++;
        }
        cout<<"Case "<<cas++<<":"<<" "<<sum<<endl;
    }
    return 0;
}
int find(int x)
{
    int r=x;
    while(par[r]!=r)
        r=par[r];
    int i=x,j;
    while(i!=r)//压缩路径
    {
        j=par[i];
        par[i]=r;
        i=j;
    }
    return r;
}
void unite(int x,int y)
{
    x=find(x);
    y=find(y);
    if(x==y)//说明x与y在同一棵树中，不做处理
        return;
    if(rank[x]<rank[y])//若树x的高度小于树y的高度，则从树x向树y连边
        par[x]=y;
    else
    {
        par[y]=x;//否则从树y向树x连边
        if(rank[x]==rank[y])
            rank[x]++;//因为是树y向树x连边，所以树x的高度增加1
    }
}