zoukankan      html  css  js  c++  java
  • poj_2524Ubiquitous Religions

    Ubiquitous Religions
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 19413   Accepted: 9539

    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
    并查集水题=。=
    #include<iostream>
    #include<cstdio>
    #include<map>
    #include<cstring>
    #include<cmath>
    #include<vector>
    #include<algorithm>
    #include<set>
    #include<string>
    #include<queue>
    #include <stack>
    using namespace std;
    #pragma warning(disable : 4996)
    const int MAXN = 50005;
    int father[MAXN], ranks[MAXN];
    int ans;
    
    void Make_set(int n)
    {
    	for(int i = 1; i <= n; i++)
    	{
    		father[i] = i;
    		ranks[i] = 0;
    	}
    }
    
    int Find_Set(int x)
    {
    	if(x != father[x])
    	{
    		father[x] = Find_Set(father[x]);
    	}
    	return father[x];
    }
    
    void Unoin_Set(int x, int y)
    {
    	x = Find_Set(x);
    	y = Find_Set(y);
    	if(x == y)
    	{
    		return;
    	}
    	if(ranks[x] > ranks[y])
    	{
    		father[x] = y;
    	}
    	else if(ranks[x] < ranks[y])
    	{
    		father[y] = x;
    	}
    	else
    	{
    		father[y] = x;
    		ranks[x]++;
    	}
    	ans--;
    }
    
    int main()
    {
    	freopen("in.txt", "r", stdin);
    	int n, m, x, y, count = 1;
    	while (scanf("%d %d", &n, &m) != EOF)
    	{
    		if(n == 0 && m == 0)
    		{
    			break;
    		}
    		Make_set(n);
    		ans = n;
    		while (m--)
    		{
    			scanf("%d %d", &x, &y);
    			Unoin_Set(x, y);
    		}
    		printf("Case %d: %d\n", count++, ans);
    	}
    	return 0;
    }

  • 相关阅读:
    selenium介绍
    python爬虫之requests模块介绍
    SQLAlchemy框架用法详解
    JS判断是否为移动版浏览器
    goahead Web Server 环境搭建(Linux)
    Android 应用层APP发送短信
    Git使用相关问题汇总
    Spring boot 默认首页配置
    Android Studio高版本中文输入异常
    Android ADB 常用命令详解
  • 原文地址:https://www.cnblogs.com/lgh1992314/p/5835082.html
Copyright © 2011-2022 走看看