How Many Tables
来源:互联网 发布:程序员之死 事件女方 编辑:程序博客网 时间:2024/05/17 06:30
题目地址http://acm.hdu.edu.cn/showproblem.php?pid=1213
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 32616 Accepted Submission(s): 16273
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
题意:如果a与b认识,b与c认识,那么a与c也认识,相互认识的人可以坐在一张桌子上。求解最少需要几张桌子。
直接并查集
要注意 初始化数据时 i从1开始
void init(int n){for (int i = 0; i <= n; i++)par[i] = i;}
#include<cstdio>int pre[1050];int n,m,i,j,p1,p2,f1,f2,sum;int find(int x){return x==pre[x] ? x : pre[x]=find(pre[x]);}void Union(int x,int y){int f1=find(x);int f2=find(y);if(f1!=f2)pre[f1]=f2;}int main(){int t;scanf("%d",&t);while(t--){sum=0;scanf("%d%d",&n,&m);for(i=1;i<=n;i++)pre[i]=i;for(i=0;i<m;i++){scanf("%d%d",&p1,&p2);Union(p1,p2);}for(i=1;i<=n;i++){if(pre[i]==i)sum++;}printf("%d\n",sum);//getchar();}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
- php使用composer常用问题及解决办法集:zlib_decode():data error......
- 跳转商品详情
- (初学者)用python进行自然语言处理笔记二
- 科目二流程
- 通讯录联系人跳转
- How Many Tables
- mysql 5.7以上版本下载及安装
- JS生成UUID的方法实例
- gnome登录界面无法登录
- UI04-UIImageView图片组件
- laravel excel 判断带 各种页面提示参数
- MOOC清华《程序设计基础》第8章:以二进制文件存储链表
- sublime插件Emmet的使用
- C# 正则表达式实现字符串搜索