hdu 1213 How Many Tables 解题报告
2016-03-03 21:03
369 查看
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21257 Accepted Submission(s): 10532
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省赛集训队选拔赛之热身赛
基础并查集,注意本题的输出格式即可。
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; const int Max = 1005; int fa[Max],t,n,m,a,b; int Find(int x) { if(x==fa[x])return x; else return fa[x]=Find(fa[x]); } bool same(int x,int y) { x=Find(x); y=Find(y); if(x==y)return true; return false; } void unite(int x,int y) { x=Find(x); y=Find(y); if(x==y)return; fa[x]=y; } int main() { scanf("%d",&t); while(t--){ scanf("%d%d",&n,&m); for(int i=1;i<=n;i++){ fa[i]=i; } for(int i=1;i<=m;i++){ scanf("%d%d",&a,&b); if(!same(a,b)){ unite(a,b); } } int ans=0; for(int i=1;i<=n;i++){ if(i==fa[i]){ ans++; } } printf("%d\n",ans); } return 0; }
相关文章推荐
- ForEach循环的使用
- Java杭电2072
- MAC下使用nasm编译汇编
- 蓝桥杯:圆的面积
- 什么是信息增益(Information Gain)
- openfire连接登陆优化方案
- 软件工程学习笔记之基本理念
- x-Utils在android5.0下报错的解决方案
- Android Studio如何取消与SVN的关联
- 数据库中的分组
- 关于Popup的一些技巧
- poj2096概率dp
- Python3解决vs输出中文报错问题
- 多重集组合数 (DP)
- SPRING IN ACTION 第4版笔记-第四章ASPECT-ORIENTED SPRING-009-带参数的ADVICE2
- 蓝桥杯 蚂蚁感冒 不要模拟!
- Codeforces Round #316 (Div.2) C. Replacement
- XTU 1205 Range
- javascript中的prompt()用法
- bzoj 1084: [SCOI2005]最大子矩阵 dp