HDU 1213 How Many Tables

来源:互联网 发布:淘宝模板制作教程视频 编辑:程序博客网 时间:2024/06/10 01:54
Problem DescriptionToday 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.InputThe 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.OutputFor each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.Sample Input25 31 22 34 55 12 5Sample Output24AuthorIgnatius.LSource杭电ACM省赛集训队选拔赛之热身赛  RecommendEddy   |   We have carefully selected several similar problems for you:  1272 1232 1856 1325 1233 
#include<iostream>using namespace std;int p[1010];int find(int x){    if (x != p[x])        p[x] = find(p[x]);    return p[x];}void unions(int x, int y){    p[x] = y;}int t;int a, b, x, y, m, n;int main(){    cin >> t;    while (t--)    {        cin >> n >> m;        for (int i = 1; i <= n; i++)        {            p[i] = i;        }        for (int i = 0; i < m; i++)        {            cin >> a >> b;            x = find(a);            y = find(b);            if (x != y)                unions(x, y);        }        int ans = 0;        for (int i = 1; i <= n; i++)        {            if (p[i] == i)                ans++;        }        cout << ans << endl;    }    return 0;}
原创粉丝点击