hdu 1213 How Many Tables【并查集】
来源:互联网 发布:apache arrow 编辑:程序博客网 时间:2024/04/28 17:32
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.
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;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;}
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开发中的错误(1)
- javascript中的prompt()用法
- iOS中使用正则表达式 RegexKitLite
- 在windows系统上,给Nim程序加上图标
- hdu 1213 How Many Tables【并查集】
- 关于Popup的一些技巧
- 数据库中的分组
- 第六次选拔_x的x次幂
- webmagic的设计机制及原理-如何开发一个Java爬虫
- x-Utils在android5.0下报错的解决方案
- 将张三,李四,王二按照中文首字母排序
- ForEach循环的使用
- MAC下使用nasm编译汇编