HDU-1213-How Many Tables【并查集】
来源:互联网 发布:c语言设计 谭浩强pdf 编辑:程序博客网 时间:2024/06/05 09:14
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24324 Accepted Submission(s): 12169
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<cstdio>#include<algorithm>using namespace std;int n,m,fa[10010];int find(int x){if(x==fa[x])return x;return fa[x]=find(fa[x]);}void Union(int x,int y){int nx=find(x);int ny=find(y);if(nx!=ny){fa[ny]=nx;}}int main(){int t;scanf("%d",&t);while(t--){scanf("%d %d",&n,&m);for(int i=1;i<=n;i++){fa[i]=i;}int a,b;while(m--){scanf("%d %d",&a,&b);Union(a,b);}int ans=0;for(int i=1;i<=n;i++){if(fa[i]==i){ans++; // 一张桌子上必存在一个人满足 fa[i]=[i],所以要计算桌子个数,计算满足有几个 fa[i]=i 就行了 }}printf("%d\n",ans);}return 0;}
0 0
- 并查集 hdu 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(并查集练习)
- HDU 1213 How Many Tables 并查集入门
- HDU 1213 How Many Tables 并查集 水~
- HDU 1213 How Many Tables(并查集)
- [ACM] hdu 1213 How Many Tables(并查集)
- [ACM] 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(并查集)
- 关于Android开发时天天模拟器的使用
- NOIP2011提高组 聪明的质检员(重庆一中高2018级信息学竞赛测验6) 解题报告
- iOS开发之高级转场动画,tableview到collectionView自定义转场动画+手势驱动
- Android Volley完全解析(一),初识Volley的基本用法
- Android 实现图片、视频即时更新到相册
- HDU-1213-How Many Tables【并查集】
- VBox增强工具安装
- tjut 4312
- android架构规范
- HDU 1272 小希的迷宫(并查集,环的判断,连通域的判断)
- JSP内置对象
- 博客第一天
- JS之清除浮动
- Android LCD(三):Samsung LCD接口篇