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<stdio.h>
     2 #define LEN 10000
     3 
     4 int p[LEN];
     5 
     6 int _find(int x) {
     7     return p[x] == x ? x : (p[x] = _find(p[x]));
     8 }
     9 
    10 int main() {
    11     int num, ans, i, j;
    12     scanf("%d", &num);
    13     while(num--){
    14         int n, m;
    15         scanf("%d%d", &n, &m);
    16         for(i = 1; i <= n; i++)
    17             p[i] = i;
    18         for(i = 0; i < m; i++){
    19             int a, b, t1, t2;
    20             scanf("%d%d", &a, &b);
    21             t1 = _find(a);
    22             t2 = _find(b);
    23             if(t1 != t2)
    24                 p[t1] = t2;
    25         }
    26         ans = 0;
    27         for(i = 1; i <= n; i++)
    28             if(i == p[i])
    29                 ans++;
    30         printf("%d
    ", ans);
    31     }
    32     return 0;
    33 }
  • 相关阅读:
    自学Python编程的第二天----------来自苦逼的转行人
    自学Python编程的第一天----------来自苦逼的转行人
    A-B 高精度
    A+B 高精度
    [NOI2002]银河英雄传说
    口袋的天空
    修复公路(并查集)
    并查集
    Surjectivity is stable under base change
    为什么Fourier分析?
  • 原文地址:https://www.cnblogs.com/zzy9669/p/3871689.html
Copyright © 2011-2022 走看看