zoukankan      html  css  js  c++  java
  • POJ 2524 Ubiquitous Religions

    Ubiquitous Religions
    Time Limit: 5000MS   Memory Limit: 65536K
    Total Submissions: 20668   Accepted: 10153

    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
    题目大意:输入n,m代表有n个帮派,下面输入m行x,y,代表学生x,y同一个帮派,问总共有多少个帮派。
    解题方法:并查集,每次输入x,y时如果发现他们不同帮派,则n减一,然后合并。
    #include <stdio.h>
    
    typedef struct
    {
        int parent;
        int rank;
    }UFSTree;
    
    UFSTree Student[50005];
    
    void MakeSet(int n)
    {
        for (int i = 0; i <= n; i++)
        {
            Student[i].parent = i;
            Student[i].rank = 0;
        }
    }
    
    int FindSet(int x)
    {
        if (x != Student[x].parent)
        {
            return FindSet(Student[x].parent);
        }
        else
        {
            return x;
        }
    }
    
    void UnionSet(int x, int y)
    {
        x = FindSet(x);
        y = FindSet(y);
        if (Student[x].rank > Student[y].rank)
        {
            Student[y].parent = x;
        }
        else
        {
            Student[x].parent = y;
            if (Student[x].rank == Student[y].rank)
            {
                Student[y].rank++;
            }
        }
    }
    
    int main()
    {
        int m, n, x, y, nCase = 0;
        while(scanf("%d%d", &n, &m) != EOF && n != 0 && m != 0)
        {
            MakeSet(n);
            for (int i = 0; i < m; i++)
            {
                scanf("%d%d", &x, &y);
                if (FindSet(x) != FindSet(y))
                {
                    n--;
                    UnionSet(x, y);
                }
            }
            printf("Case %d: %d
    ", ++nCase, n);
        }
        return 0;
    }
  • 相关阅读:
    数据分析 --- 01. Numpy
    爬虫 --- 08. 全站爬取(CrawlSpider), 分布式, 增量式爬虫
    爬虫 --- 07. 全站爬取(手动), post请求,cookie, 传参,中间件,selenium
    数据结构 --- 02. 内存, 顺序表, 单链表
    数据结构 --- 01. 时间复杂度,timeit模块,栈,队列,双端队列
    爬虫 --- 06. scrapy框架初始,移动端数据爬取
    爬虫 --- 05. 异步协程, 浏览器自动化,
    爬虫 --- 04. 代理服务器, 验证码识别, 处理cookie,线程池
    爬虫 --- 02. 爬取图片,数据解析
    一个关于const 变量作为map键值的Bug
  • 原文地址:https://www.cnblogs.com/lzmfywz/p/3258420.html
Copyright © 2011-2022 走看看