How Many Tables
来源:互联网 发布:录像配音软件 编辑:程序博客网 时间:2024/06/01 10:30
题目描述
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.
输入
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.
输出
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
样例输入
26 41 22 33 41 48 101 22 35 67 54 63 66 72 52 44 3
样例输出
32
提示
#include <cstdio>const int maxn=1005;int tree[maxn];int findRoot(int x){ if(tree[x]==-1) return x; else{ int tmp=findRoot(tree[x]); tree[x]=tmp; return tmp; }}int main(){ int T; scanf("%d",&T); while(T--){ int n,m; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) tree[i]=-1; for(int i=1;i<=m;i++){ int a,b; scanf("%d%d",&a,&b); a=findRoot(a); b=findRoot(b); if(a!=b) tree[a]=b; } int ans=0; for(int i=1;i<=n;i++) if(tree[i]==-1) ans++; printf("%d\n",ans); } return 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
- Github工具(未完待续)
- LeetCode题解
- windows bat文件中的变量带有小括号的问题及解决办法
- ise 中的错误编号的意义
- Java 访问控制符
- How Many Tables
- 20171001_Alfred介绍和一些workflow推荐
- 计算机图形学几何工具算法详解(第2章):(hua)笔(shui)记
- SSH入门项目-4-功能完善之CRUD
- 字符串全排列
- GCC编译过程分解
- Linux 学习路程(3)文件权限
- 关于verilog几条语法
- 【UVA 548 Tree】二叉树构造 & 遍历