并查集--Ubiquitous Religions

 

Ubiquitous Religions

Time Limit: 1000MS Memory limit: 65536K

题目描述

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.

输入

 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.

输出

 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.

示例输入

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

示例输出

Case 1: 1
Case 2: 7
    #include <stdio.h>
    int bin[100002];
    int findx(int x)
    {
        int r=x;
        while(bin[r] !=r)
            r=bin[r];
        return r;
    }
    void merge(int x,int y)
    {
        int fx,fy;
        fx = findx(x);
        fy = findx(y);
        if(fx != fy)
            bin[fx] = fy;
    }

    int main()
    {        int n, m, i, j, x, y, q = 1 , count;//n,m分别为观众数和查询次数,x,y为每次查询观众的编号,q用改变case后的序号
        while(scanf("%d",&n)!=EOF)
        {
            count = 0;

            for(i=1;i<=n;i++)
                bin[i] = i;
            scanf("%d",&m);
            if(n == 0 && m == 0)
                break;
            for(j=0; j<m; j++)
            {
                scanf("%d %d",&x,&y);
                merge(x, y);
            }
          for(i=1; i<=n; i++)
                if(bin[i] == i)
                {
                     count ++;
                }
            printf("Case %d: %d\n", q++, count);

        }
        return 0;
    }

posted @   6bing  阅读(304)  评论(0编辑  收藏  举报
编辑推荐:
· 为什么说在企业级应用开发中,后端往往是效率杀手?
· 用 C# 插值字符串处理器写一个 sscanf
· Java 中堆内存和栈内存上的数据分布和特点
· 开发中对象命名的一点思考
· .NET Core内存结构体系(Windows环境)底层原理浅谈
阅读排行:
· 为什么说在企业级应用开发中,后端往往是效率杀手?
· DeepSeek 解答了困扰我五年的技术问题。时代确实变了!
· 本地部署DeepSeek后,没有好看的交互界面怎么行!
· 趁着过年的时候手搓了一个低代码框架
· 推荐一个DeepSeek 大模型的免费 API 项目!兼容OpenAI接口!
点击右上角即可分享
微信分享提示