hdu 1213How Many Tables
来源:互联网 发布:元朝是怎么灭亡的 知乎 编辑:程序博客网 时间:2024/05/22 12:37
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27633 Accepted Submission(s): 13716
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
Author
Ignatius.L
Source
杭电ACM省赛集训队选拔赛之热身赛
Recommend
Eddy | We have carefully selected several similar problems for you: 1272 1856 1325 1233 1198
#include<iostream>#include<math.h>#include<memory.h>using namespace std;int a[1001];int find(int t){if(t!=a[t])a[t]=find(a[t]);return a[t];}int main(){int n,m,t;cin>>t;while(t--){ cin>>n>>m; int num,x,y;//记录还需要的路的数目 for(int i=0;i<=n;i++)//并查集初始化 a[i]=i; num=n;//最坏的情况下需要的路的数目 for(int i=0;i<m;i++){cin>>x>>y;x=find(x);//找x的祖先 y=find(y);//找y的祖先 if(x!=y)//x和y的祖先不相同增加一条路 {a[y]=x;// num--;} } cout<<num<<endl; }}
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
- [线段树 最长上升序列] BZOJ 2957 楼房重建
- SSL 1212——大厅安排
- Android中肯定会遇到的问题——内存泄漏
- Mongodb中FAQ整理
- 卷积神经网络(CNN)模型结构
- hdu 1213How Many Tables
- Java线程安全和非线程安全
- Android事件分发机制完全解析,带你从源码的角度彻底理解(上)
- Java读取外部资源的方法
- 使用Fragment,建立一个没有滑动效果的切换,可配合抽屉使用
- APP开发实战157-Ordered broadcast(有序广播)简介
- mysql5.7无法启动 服务没有报告任何错误
- 16蓝桥杯入门—圆的面积
- 剑指offer 链表中倒数第k个节点