How Many Tables
来源:互联网 发布:sql主键 编辑:程序博客网 时间:2024/05/20 04:48
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 16865 Accepted Submission(s): 8270
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>using namespace std;int father[1010],rrank[1010];void init(int n){int i;for(i=1;i<=n;i++){father[i]=i;rrank[i]=1;}}int Find_Set(int x){if(x!=father[x]) return Find_Set(father[x]);return father[x];}void Union_Set(int x,int y){x=Find_Set(x);y=Find_Set(y);if(x==y) return ;if(rrank[x]>=rrank[y]){father[y]=x;rrank[x]+=rrank[y];}else{father[x]=y;rrank[y]+=rrank[x];}}int main(){int t,n,m,i,a,b,cnt;cin>>t;while(t--){cin>>n>>m;cnt=0;init(n);for(i=0;i<m;i++){cin>>a>>b;Union_Set(a,b);}for(i=1;i<=n;i++){if(i==father[i]) cnt++;}cout<<cnt<<endl;}return 0;}
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
- VS2010使用Skin++
- POJ2945 Find the Clones Tire树
- Java 多线程 并发编程
- Icons
- kmp 求解匹配数量
- How Many Tables
- IOS系统自带对话框
- 关于hadoop程序优化的几点建议
- Android客户端与PHP服务端通信(五)---移植使用极光推送
- Icon资源详解[1]
- JVM学习---JAVA内存
- 用筛选法求出100以内的素数
- 快速乘法/幂 算法详解
- 【字符编码系列之一】多字节数据的字节序