zoukankan      html  css  js  c++  java
  • HDU 1213 How Many Tables

    A - How Many Tables
    Time Limit:1000MS    Memory Limit:32768KB    64bit IO Format:%I64d & %I64u

    Description

    Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.

    One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.

    For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.
     

    Input

    The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.
     

    Output

    For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
     

    Sample Input

    2 5 3 1 2 2 3 4 5 5 1 2 5
     

    Sample Output

    2 4


    #include<stdio.h>

    #include<string.h>
    #include<cmath>
    #include<queue>
    #include<iostream>
    using namespace std;

    int f[1111],a,b,c,m,n;
    int find(int x)
    {
        while(x!=f[x])x=f[x];
        return x;
    }

    int main()
    {
        int t;cin>>t;
        while(t--)
        {
            cin>>n>>m;
            for(int i=1;i<=n;i++)
            {
                f[i]=i;
            }
            for(int i=0;i<m;i++)
            {
                scanf("%d%d",&a,&b);
                a=find(a);
                b=find(b);
                f[b]=a;

            }
            int cnt=0;
            for(int i=1;i<=n;i++)
            {
                if(i==f[i])cnt++;
            }
            printf("%d ",cnt);

        }
        return 0;
    }

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    IBatisNet基础组件
    IBatis 简易框架搭建
    JQuery 如何选择带有多个class的元素
    ASP.net MVC自定义错误处理页面的方法
    Console的使用——Google Chrome代码调试
    关闭 Visual Studio 2013 的 Browser Link 功能
    VS2013自带的Browser Link功能引发浏览localhost网站时不停的轮询
    JSON.parse()和JSON.stringify()
    Jquery easyui tree的使用
    EasyUI Tree判断节点是否是叶
  • 原文地址:https://www.cnblogs.com/wmxl/p/4662691.html
Copyright © 2011-2022 走看看