hdu1213 How Many Tables(并查集)
2015-07-25 13:40
246 查看
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17946 Accepted Submission(s): 8822
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
2 5 3 1 2 2 3 4 5 5 1 2 5
Sample Output
2 4
Author
Ignatius.L
Source
杭电ACM省赛集训队选拔赛之热身赛
Recommend
Eddy | We have carefully selected several similar problems for you: 1856 1325 1198 1102 1162
判断几个人是否是朋友。。。。。。。。。。。。。。。。。。。。。。
只要我们把这几个人看成几棵树好啦。。。我们就数数有几棵树就行。
既然要数有几棵树,那我们怎么区分它们是不是同一棵树呢?就需要判断它们的老祖宗是不是相同。。。
并查集啦 并查集
看代码,看代码。。。先想想思想,再自己动手去做,不要照抄、、、
#include <stdio.h> #include <string.h> int fa[1005],n; int find(int x) { if(fa[x]!=x) fa[x]=find(fa[x]); return fa[x]; } void init() { for(int i=1;i<=n;i++) fa[i]=i; } int main() { int ncase,m; scanf("%d",&ncase); while(ncase--) { scanf("%d %d",&n,&m); init(); for(int i=0;i<m;i++) { int a,b; scanf("%d %d",&a,&b); int x=find(a); int y=find(b); if(x!=y) fa[x]=y; } int count=0; for(int i=1;i<=n;i++) if(fa[i]==i) count++; printf("%d\n",count); } return 0; }
相关文章推荐
- SpringMVC简单项目配置
- 机房收费系统之组合查询
- 微软 .net 你更新这么快IDE vs2015 、语法糖 6.0、framework、‘吹得这么牛,然并用
- Select count(*)和Count(1)的区别和执行方式
- apk打包过程
- Shell中反引号(`)与$()用法的区别
- swift基础语法
- CentOS 忘记 root password处理
- PHP判断用户登录状态
- POJ 1164:The Castle
- C# using 三种使用方式
- 包管理器控制台常用命令
- POJ 1164:The Castle
- 样本方差为何除以n-1
- Select count(*)和Count(1)的区别和执行方式
- Linux学习一
- ios获取当前手机wifi名称
- 根据本地相片路径上传图片到服务器的2中方法
- HTML之表格与表单
- UVa 11400 - Lighting System Design(DP)