zoukankan      html  css  js  c++  java
  • HDU 1213.How Many Tables-并查集

    How Many Tables

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 45795    Accepted Submission(s): 22909


    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
     
    Author
    Ignatius.L
     
    Source
     
     
     
     
    代码:
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int pre[1050];
     4 int find(int x){
     5     int r=x;
     6     while(pre[r]!=r)
     7         r=pre[r];
     8         int i=x,j;
     9         while(i!=r){
    10             j=pre[i];
    11             pre[i]=r;
    12             i=j;
    13         }
    14         return r;
    15 }
    16 int main(){
    17     int n,m,h,p1,p2,i,total,f1,f2;
    18     while(~scanf("%d",&n)){
    19         while(n--){
    20           scanf("%d",&m);
    21           total=m;
    22          for(i=1;i<=m;i++)
    23              pre[i]=i;
    24        scanf("%d",&h);
    25        while(h--){
    26         scanf("%d%d",&p1,&p2);
    27         f1=find(p1);
    28         f2=find(p2);
    29         if(f1!=f2){
    30             pre[f2]=f1;
    31             total--;
    32         }
    33        }
    34        printf("%d
    ",total);
    35        }
    36     }
    37     return 0;
    38 }
  • 相关阅读:
    02.零成本实现WEB性能测试-基于APACHE JMETER
    Apache JMeter--网站自动测试与性能测评
    01.天幕红尘
    php-fpm介绍及配置
    Linux环境下搭建php开发环境的操作步骤
    Linux下PHP开发环境搭建
    nginx 502 Bad Gateway 错误问题收集
    Nginx配置文件详细说明
    Linux下查看MySQL的安装路径
    LINUX下YUM源配置
  • 原文地址:https://www.cnblogs.com/ZERO-/p/9740875.html
Copyright © 2011-2022 走看看