hdu 1213 How Many Tables (并查集)
2015-07-27 15:28
405 查看
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.
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
Sample Output
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.
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
2 5 3 1 2 2 3 4 5 5 1 2 5
Sample Output
2 4
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int pre[2000]; int find(int x) { int r=x; while(r!=pre[r]) r=pre[r]; int i=x,j; while(i!=r){ j=pre[i]; pre[i]=r; i=j; } return r; } int main() { int n,m,i,j,t,x,y; while(scanf("%d",&t)!=EOF){ while(t--){ scanf("%d%d",&n,&m); for(i=1;i<=n;i++) pre[i]=i; for(i=1;i<=m;i++){ cin>>x>>y; int fx=find(x); int fy=find(y); if(fx!=fy){ pre[fx]=fy; n--; } } cout<<n<<endl; } } return 0; }
相关文章推荐
- 明明白白AOP(傻瓜也会心领神会)
- Linux学习1_Linux命令及英文全称
- 对策论一
- Borg Maze
- 找出数组中重复次数最多的数
- 线段树单点更新 - HDU 1166 敌兵布阵 1754 I Hate it
- jquery操作表格行(增加、删除)
- 64 mysql 字段批量替换
- 一次完整的HTTP请求所经历的7个步骤
- Borg Maze 分类: POJ 2015-07-27 15:28 5人阅读 评论(0) 收藏
- 2.0-shell中断继续退出
- Android透明动画
- 后台定位上传的代码实践
- 图结构练习——最小生成树
- 64 2种实现弹出框的插件
- Android透明动画
- (easy)LeetCode 202.Happy Number
- URAL 1025
- 海思HI3521 SDK移植开发note
- 1.9-while循环