hdu 1213 How Many Tables
来源:互联网 发布:mysql 去掉时分秒 编辑:程序博客网 时间:2024/05/16 09:49
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8018 Accepted Submission(s): 3892
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这其实就是并查集的简单题目,看可以构建多少个数而已
在判断有几个桌子的时候,我们一般的都是在合并完成后扫描整个父亲数组,发现几个father[i]==i,就判断有多少个树,从而需要多少个桌子
AC代码:
#include <iostream>#include <cstdio>using namespace std;int father[1005];int getfather(int n){ while(n!=father[n]) n=father[n]; return n;}int main(){ int n,m,t,a,b; cin>>t; while(t--) { cin>>n>>m; for(int i=1;i<=n;i++) father[i]=i; for(int i=1;i<=m;i++) { cin>>a>>b; int roota=getfather(a); int rootb=getfather(b); if(roota!=rootb) father[rootb]=roota; } int cnt=0; for(int i=1;i<=n;i++) if(father[i]==i) cnt++; cout<<cnt<<endl; } return 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
- JAVA基础之String字符串笔记总结
- golang sort 排序
- 归并排序三种实现方法(递归、非递归和自然合并排序)
- Disable touchpad in Linux
- Vim 中使用 OmniComplete 为 C/C++ 自动补全
- hdu 1213 How Many Tables
- unity基础开发----Rigidbody,Collider,PhysicMaterial问题
- java控制台输入密码禁用回显
- 进程与线程——Linux进程与线程通讯
- VirtualBox 主机与虚拟机互相访问且均上外网
- BJDP-北京设计模式学习组 (bjdp.yolasite.com)
- 图形、游戏物理 学习、开发、工具(来自网络的很多免费的好资源 )
- 《认知与设计:理解UI设计准则》读书笔记
- HTTP505错误