HDU 1213 How Many Tables
来源:互联网 发布:淘宝宝贝怎么编辑尺寸 编辑:程序博客网 时间:2024/06/02 20:34
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
题解:
并查集的水题,直接上代码。
#include <iostream>#include <cstdio>#include <cmath>#include <stdlib.h>#include <cstring>using namespace std;int root[1100];int look(int n){ if(n!=root[n]) root[n]=look(root[n]); return root[n];}void _union(int a,int b){ a=look(a); b=look(b); if(a!=b) root[a]=b;}int main(){ int n; scanf("%d",&n); while(n--) { int mm,nn,i=0,x,y; scanf("%d%d",&mm,&nn); for(; i<=mm; i++) root[i]=i; i=1; while(i++<=nn) { scanf("%d%d",&x,&y); _union(x,y); } int sum=0; for(i=1; i<=mm; i++) if(root[i]==i) sum++; printf("%d\n",sum); } return 0;}
- hdu 1213 how many tables
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- Hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 how many tables
- hdu 1213 How Many Tables
- hdu 1213how many tables
- hdu 1213 How Many Tables
- Hdu 1213 - How Many Tables
- HDU 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- C是只能使用标量的语言
- [日常学习]灵感来自MergeSort的求逆序数...
- maven2下pom.xml的json-lib的配置
- myeclipse使用本地jdk
- POJ-3228-Gold Transportation
- HDU 1213 How Many Tables
- or1200下Raw-OS学习(仿真环境篇)
- OpenVPN中的几个和连接相关的Timer解析
- 数据结构练习题---先序遍历二叉树
- html5 拖放操作集锦
- hdu 1358 Period
- 数据结构练习题---后序遍历二叉树
- do...while(0)的妙用
- ab测试tomcat并发性能(测试BIO与NIO差别)(一)