ACM 数据结构-并查集 HDU 1213 How Many Tables

原创 2016年05月30日 13:04:49
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
 


并查集最简单的入门题,模板题

#include<iostream>
using namespace std;
int p[1011];
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 main()
{
 int i;
    int T,a,b,x,y,n,m;
    cin>>T;
    while(T--)
    {

        cin>>n>>m;
        for(i=1;i<=n;i++)
            p[i]=i;
        for( 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;
    }
}

 

版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU ACM 1213.How Many Tables(简单的 并查集)

/********************************** 题目大意:把是朋友的人放到一组,n个人可以分成几组,并输出组数; 题目解析:运用并查集把有关系的人合并到一组,最后遍历数组f...

[ACM] hdu 1213 How Many Tables(并查集)

How Many Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)...

ACM-并查集之How Many Tables——hdu1213

ACM 并查集 How Many Tables hdu1213

ACM-并查集- How Many Tables-HDU - 1213

D - How Many Tables Today is Ignatius' birthday. He invites a lot of friends. Now it's dinner t...

hdu--1213 How Many Tables(并查集)

题目:1213 Problem Description Today is Ignatius' birthday. He invites a lot of friends. Now it's d...

hdu1213 How Many Tables (裸并查集)

How Many Tables Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...

HDU 1213 How Many Tables【简单并查集】

简单并查集题目。
  • TaiFu_S
  • TaiFu_S
  • 2017年05月06日 18:14
  • 5285

HDU 1213 How Many Tables( 并查集)

How Many Tables Problem Description Today is Ignatius' birthday. He invites a lot of friends. Now i...

HDU-畅通工程-1232(并查集)How Many Tables(1213)

/*畅通工程 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Sub...

hdu1213 How Many Tables 并查集

链接:http://hdu.hustoj.com/showproblem.php?pid=1213 How Many Tables Time Limit: 2000/1000 MS (Ja...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:ACM 数据结构-并查集 HDU 1213 How Many Tables
举报原因:
原因补充:

(最多只允许输入30个字)