zoukankan      html  css  js  c++  java
  • HDU 1213 How Many Tables(并查集裸题)

    Problem 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
     
     1 #include<iostream>
     2 #include<cstdio>
     3 #include<algorithm>
     4 #include<queue>
     5 #include<map>
     6 #include<vector>
     7 #include<cmath>
     8 #include<cstring>
     9 using namespace std;
    10 
    11 int p[1005];
    12 int find(int i)
    13 {
    14     if(p[i]==i)
    15         return i;
    16     else
    17         return find(p[i]);
    18 }
    19 
    20 int main()
    21 {
    22     int T,n,m,a,b,x,y;
    23     scanf("%d",&T);
    24     while(T--)
    25     {
    26         scanf("%d%d",&n,&m);
    27         for(int i=1;i<=n;i++)
    28             p[i]=i;
    29         for(int i=1;i<=m;i++)
    30         {
    31             scanf("%d%d",&a,&b);
    32             x=find(a);
    33             y=find(b);
    34             if(x!=y)
    35                 p[x]=y;
    36         }
    37         int ans=0;
    38         for(int i=1;i<=n;i++)
    39             if(p[i]==i)
    40                 ans++;
    41         printf("%d
    ",ans);
    42     }
    43     return 0;
    44 }
     
  • 相关阅读:
    第12课 计算器核心解析算法(上)
    第11课 Qt中的字符串类
    第10课 初探 Qt 中的消息处理
    第9课 计算器界面代码重构
    第8课 启航!第一个应用实例
    第7课 Qt中的坐标系统
    第6课 窗口部件及窗口类型
    第5课 Qt Creator工程介绍
    第4课 Hello QT
    给Linux内核增加一个系统调用的方法(转)
  • 原文地址:https://www.cnblogs.com/Annetree/p/7356501.html
Copyright © 2011-2022 走看看