HDOJ1213 How Many Tables(并查集)
来源:互联网 发布:人工智能和物联网区别 编辑:程序博客网 时间:2024/05/29 02:27
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
互相认识的人坐在一张桌子,问你需要准备多少张桌子。
并查集模板题。
AC代码:
#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;int n, m, par[1010];int find(int x){if(par[x] == x) return x;else return par[x] = find(par[x]);}void unite(int x, int y){x = find(x);y = find(y);if(x == y) return;par[y] = x;}void init(){for(int i = 1; i <= n; ++i)par[i] = i;}int main(int argc, char const *argv[]){int t;scanf("%d", &t);while(t--) {scanf("%d%d", &n, &m);init();for(int i = 0; i < m; ++i) {int a, b;scanf("%d%d", &a, &b);unite(a, b);}int ans = 0;for(int i = 1; i <= n; ++i)if(par[i] == i) ans++;printf("%d\n", ans);}return 0;}
1 0
- hdoj1213 How many tables?(并查集)
- HDOJ1213 How Many Tables(并查集)
- 【HDOJ1213】How Many Tables[并查集模板题]
- HDOJ1213. How many tables(并查集连通块计数)
- HDOJ1213 How Many Tables 并查集裸题
- How Many Tables<hdoj1213>
- 【hdu1213】How Many Tables【并查集】
- How Many Tables(并查集)
- How Many Tables hdu1213 并查集
- hdu1213(How Many Tables 并查集)
- hdu_1213 how many tables (并查集)
- Hdu1213 - How Many Tables - 并查集
- HDU1213 How Many Tables 【并查集】
- 并查集---How Many Tables
- HDU1213 How Many Tables【并查集】
- HDU1213 How Many Tables 【并查集】
- [并查集]How Many Tables
- hdu1213 How Many Tables(并查集)
- 关于创新工场的一道笔试题
- leetcode 206: Reverse Linked List
- 不知所谓
- 《深入浅出struts2》--第二十四章,Tiles插件
- 达内学习日志Day05(下):循环嵌套和数组的练习(一)
- HDOJ1213 How Many Tables(并查集)
- 同时查找数组中最大和最小值
- tarjan算法求联通块中求割点和割边
- POJ 3254Corn Fields
- bugzilla中bug的状态变更
- 视频播放器ckplayer,以下是连续播放的代码,
- Builder(建造者)设计模式
- 关于类里面依赖,聚合,继承之间的关系
- 怎么计算数组中实际元素的个数?