How Many Tables
来源:互联网 发布:网络带给我们的坏处 编辑:程序博客网 时间:2024/06/05 02:21
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19538 Accepted Submission(s): 9714
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
:做完发现这道题和hdu 1232畅通工程是一样的,只是格式不一样,输入数据之间的空行是键盘输入的,需要用一个getchar()接收空行;
#include<iostream>#define Size 1001using namespace std;int father[Size];int find(int x){ while(x!=father[x]) x=father[x]; return x;}int merage(int x,int y){ x=find(x); y=find(y); if(x!=y) father[x]=y; }int main(){ int T,n,m,i,x,y,s; cin>>T; while(T--){ cin>>n>>m; for(i=1;i<=n;i++) father[i]=i; for(i=0;i<m;i++) { cin>>x>>y; merage(x,y); } s=0; for(i=1;i<=n;i++) if(father[i]==i)s++; cout<<s<<endl; getchar(); }}
0 0
- How Many Tables
- HDOJ How Many Tables
- hduoj1213:How Many Tables
- hdu How Many Tables
- HDU1213:How Many Tables
- HDU1213--How Many Tables
- hdu1213-How Many Tables
- hdu1213 How Many Tables
- HDU How Many Tables
- hdu_1213 How Many Tables
- hdu1213 How Many Tables
- How Many Tables
- How Many Tables
- HDU How Many Tables
- HDU1213 How Many Tables
- hdu1213 How Many Tables
- How Many Tables
- How Many Tables 1213
- C++设计模式[九]外观模式
- hdu 4691 Front compression(后缀数组)
- Java内存与垃圾回收
- 杭电ACM1114(完全背包)
- 明天面试,大前天离职
- How Many Tables
- OpenGL_Qt学习笔记之_05(纹理映射)
- 数据结构基础5.4:堆(HEAP)的基本操作(插入与删除)
- leetcode:Pascal's Triangle II
- Object—C基础第一课
- hdu 5343 MZL's Circle Zhou(后缀自动机)
- OpenGL_Qt学习笔记之_06(纹理滤波、光照和色彩融合)
- muduo库阅读(14)——倒数计数器
- OpenGL_Qt学习笔记之_07(闪烁的星星)