HDU1213 How Many Tables
来源:互联网 发布:php curl exec 不输出 编辑:程序博客网 时间:2024/05/18 04:32
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27986 Accepted Submission(s): 13880
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省赛集训队选拔赛之热身赛
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int n,m,t;int par[1005];int find(int x){if(par[x] == x)return x;return find(par[x]);}void UniteSet(int u, int v){int x = find(u);int y = find(v);if(x == y)return ;elsepar[x] = y;}int main(){scanf("%d",&t);while(t --){scanf("%d%d",&n,&m);for(int i = 1; i <= n; i ++){par[i] = i;}int u,v;while(m --){scanf("%d%d",&u,&v);UniteSet(u,v);}int cnt = 0;for(int i = 1; i <= n; i ++){if(i == par[i])cnt ++;}printf("%d\n",cnt);}return 0;}
0 0
- HDU1213:How Many Tables
- HDU1213--How Many Tables
- hdu1213-How Many Tables
- hdu1213 How Many Tables
- hdu1213 How Many Tables
- HDU1213 How Many Tables
- hdu1213 How Many Tables
- How Many Tables hdu1213
- HDU1213---How Many Tables
- hdu1213 How Many Tables
- hdu1213 How Many Tables
- HDU1213 How Many Tables
- hdu1213 How Many Tables
- [hdu1213] How Many Tables
- HDU1213-How Many Tables
- hdu1213 How Many Tables
- HDU1213 How Many Tables
- HDU1213 How Many Tables
- 修该C++项目的名称
- robot framework环境搭建
- html的相对路径和绝对路径
- 随手摘抄
- magent安装:错误:event.h:没有那个文件或目录
- HDU1213 How Many Tables
- SpringMVC4+thymeleaf3的一个简单实例(form表单数据验证)
- 认识border
- 字节序
- rosserial_arduino的安装及使用
- cookies,sessionStorage,localStorage的区别
- Maven导出Project依赖的jar包
- Github常用命令大全
- Struts2的工作原理