zoukankan      html  css  js  c++  java
  • poj 2524 -- Ubiquitous Religions

    Ubiquitous Religions
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 22612   Accepted: 11140

    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

    简单并查集,不解释。。。

    /*======================================================================
     *           Author :   kevin
     *         Filename :   UbiquitousReligions.cpp
     *       Creat time :   2014-05-15 11:28
     *      Description :
    ========================================================================*/
    #include <iostream>
    #include <algorithm>
    #include <cstdio>
    #include <cstring>
    #include <queue>
    #include <cmath>
    #define clr(a,b) memset(a,b,sizeof(a))
    #define M 50005
    using namespace std;
    int s[M],father[M],rank[M];
    int n,m;
    void make_set()
    {
    	for(int i = 1; i <= n; i++){
    		father[i] = i;
    		rank[i] = 0;
    	}
    }
    int find_set(int x)
    {
    	if(x != father[x]){
    		father[x] = find_set(father[x]);
    	}
    	return father[x];
    }
    void Union(int x,int y)
    {
    	x = find_set(x);
    	y = find_set(y);
    	if(x == y){
    		return ;
    	}
    	if(rank[x] > rank[y]){
    		father[y] = x;
    	}
    	else{
    		if(rank[x] == rank[y]){
    			rank[y]++;
    		}
    		father[x] = y;
    	}
    }
    int main(int argc,char *argv[])
    {
    	int cas = 1;
    	while(scanf("%d%d",&n,&m)!=EOF && n+m){
    		make_set();
    		int a,b;
    		for(int i = 0; i < m; i++){
    			scanf("%d%d",&a,&b);
    			Union(a,b);
    		}
    		clr(rank,0);
    		int cnt = 0;
    		for(int i = 1; i <= n; i++){
    			int x = find_set(i);
    			if(x == i) cnt++;
    		}
    		printf("Case %d: %d
    ",cas++,cnt);
    	}
    	return 0;
    }
    
    Do one thing , and do it well !
  • 相关阅读:
    天涯何远 咫尺相依
    Load runner 11在多台测试机上执行一个场景的方法
    利用MVC4新特性为站点添加移动视图
    让django像Asp.Net Mvc一样自动匹配Controller和Action
    使用TFS API前提条件:SDKs
    ubuntu手动安装jdk并配置jetty
    [zz] Install rpm in Ubuntu
    64位ubuntu下安装32位jdk
    [zz] Ubuntu11.04安装谷歌输入法
    SpringCloud gateway lb//方式+ nacos 503 三种解决方案
  • 原文地址:https://www.cnblogs.com/ubuntu-kevin/p/3729750.html
Copyright © 2011-2022 走看看