zoukankan      html  css  js  c++  java
  • HDU 1213(并查集)

    How Many Tables

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


    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   |   We have carefully selected several similar problems for you:  1232 1856 1233 1198 1863
    /*
    并查集入门题,无坑点。
    */
    #include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int maxn = 1050; int fa[maxn]; int T, N, M; int u, v; int Find(int u) { if(u == fa[u]) return fa[u]; else return fa[u] = Find(fa[u]); } void adde(int u, int v) { int x = Find(u); int y = Find(v); if(x != y) fa[x] = fa[y]; } int main () { scanf("%d", &T); while(T--) { scanf("%d%d", &N, &M); for(int i = 1; i <= N; i++) fa[i] = i; for(int i = 1; i <= M; i++) { scanf("%d%d", &u, &v); adde(u, v); } int ans = 0; for(int i = 1; i <= N; i++) { if(fa[i] == i) ans++; } printf("%d ", ans); } return 0; }
    想的太多,做的太少。
  • 相关阅读:
    JavaScript 内置函数有什么?
    cursor(鼠标手型)属性
    用CSS制作箭头的方法
    CSS 的伪元素是什么?
    用CSS创建分页的实例
    CSS 按钮
    网页布局中高度塌陷的解决方法
    CSS 进度条
    DOM导航与DOM事件
    DOM 修改与DOM元素
  • 原文地址:https://www.cnblogs.com/pealicx/p/6518062.html
Copyright © 2011-2022 走看看