zoukankan      html  css  js  c++  java
  • poj 2524 并查集 Ubiquitous Religions

    //#include<bits/stdc++.h>
    #include<iostream>
    #include<stdio.h>
    #define max1 50005
    using namespace std;
    int pa[max1],vis[max1];
    int find(int a)
    {
        while(a!=pa[a])
        {
            pa[a]=pa[pa[a]];
            a=pa[a];
        }
        return a;
    }
    void build(int a,int b)
    {
        int fa=find(a);
        int fb=find(b);
        if(fa!=fb)
        {
            if(fa<fb)
                pa[fb]=fa;
            else
                pa[fa]=fb;
        }
    }
    int main()
    {
        int n,m;
        int t=1;
        while((scanf("%d%d",&n,&m))&&(n+m!=0))
        {
            int a,b;
            for(int i=0;i<=n;i++)
            {
                pa[i]=i;
                vis[i]=0;
            }
            for(int i=0;i<m;i++)
            {
                cin>>a>>b;
                build(a,b);
            }
            int ans=0;
            for(int i=1;i<=n;i++)
            {
                if(!vis[find(i)])
                {
                    ans++;
                    vis[find(i)]=1;
                }
            }
            printf("Case %d: %d
    ",t++,ans);
        }
        return 0;
    }
    View Code
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 30197   Accepted: 14605

    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
  • 相关阅读:
    ASP.NET 生命周期(原文翻译)
    JSON 小记
    Unity5-ABSystem(二):AssetBundle导出
    Unity5-ABSystem(一):AssetBundle原理
    《Unity 3D游戏客户端基础框架》概述
    Unity中的资源管理
    Unity中的优化技术
    深入浅出聊Unity3D项目优化:从Draw Calls到GC
    Incremental builds for IL2CPP
    Unity3D图像后处理特效——Depth of Field 3.4
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5330308.html
Copyright © 2011-2022 走看看