hdu 1213 How Many Tables
来源:互联网 发布:吉列剃须刀哪款好 知乎 编辑:程序博客网 时间:2024/05/22 08:22
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13812 Accepted Submission(s): 6776
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.
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
25 31 22 34 55 12 5
Sample Output
24
#include<iostream>
#include<cstdio>#include<cstring>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<cmath>
using namespace std;
typedef long long LL;
const int MAX=0xfffffff;
const int mx=1010;
int fa[mx];
int find(int i)
{
if(fa[i]==i) return i;
fa[i]=find(fa[i]); return fa[i];
}
int main( )
{
//freopen("1.txt","r",stdin);
int t;
scanf("%d",&t);
while(t--)
{
int n,m;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++) //建立森林
fa[i]=i;
while(m--)
{
int a,b;
scanf("%d %d",&a,&b);
a=find(a),b=find(b); //合并,注意合并的父亲,如果直接合并,会发生栈的崩溃
fa[a]=b;
}
int ans=0;
for(int i=1;i<=n;i++)
if(find(i)==i)
ans++;
printf("%d\n",ans);
}
return 0;
}
0 0
- hdu 1213 how many tables
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- Hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 how many tables
- hdu 1213 How Many Tables
- hdu 1213how many tables
- hdu 1213 How Many Tables
- Hdu 1213 - How Many Tables
- HDU 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- Android WebView和JS交互
- 完善用户体验: 活用window.location与window.open解决页面跳转问题
- 什么是mysql左链接查询 如何使用?
- typedef和define的详细区别
- 【UVA】11524-InCircle(公式推导)
- hdu 1213 How Many Tables
- 【J2SE】java多线程学习笔记
- 精益敏捷外包开发--- 信息传递篇
- 【leetcode】Remove Element
- Ogre 学习记录
- Delphi版本号对照
- aucad1012_64位安装前必须安装的程序
- UVA 11080 - Place the Guards(二分图判定)
- nyoj 93 汉诺塔(三)