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): 20996    Accepted Submission(s): 10391


    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
     
    Recommend
    Eddy
     
     
    简单使用并查集。
     
     1 #include <cstdio>
     2 #include <algorithm>
     3 #include <queue>
     4 using namespace std;
     5 const int maxn = 100050;
     6 
     7 int f[maxn];
     8 
     9 int sf(int x){ return x == f[x] ? x : f[x] = sf(f[x]); }
    10 int main()
    11 {
    12     int t, n, m, a, b, ans;
    13     scanf("%d", &t);
    14     while (t--){
    15         ans = 0;
    16         scanf("%d%d", &n,&m);
    17         for (int i = 1; i <= n; i++) f[i] = i;
    18         for (int i = 1; i <= m; i++)
    19         {
    20             scanf("%d%d", &a, &b);
    21             f[sf(a)] = sf(b);
    22         }
    23         for (int i = 1; i <= n; i++)
    24             if (f[i] == i)  ans++;
    25         printf("%d
    ", ans);
    26     }
    27 }
  • 相关阅读:
    watch 监听路由的改变
    三元运算符
    element-ui动态更改el-table某个单元格字体颜色
    vue 跨域问题导致前端无法携带cookie
    Vue 用checkbox实现两两组合多选且禁用第三个。
    表格数据宽度自适应方案
    echarts细节问题
    es6 解构赋值
    学习笔记-Python基础15-持久化-文件、pickle、shelve
    学习笔记-Python基础14-PyCharm调试
  • 原文地址:https://www.cnblogs.com/cumulonimbus/p/5185066.html
Copyright © 2011-2022 走看看