HDU1213 How Many Tables 【标准并查集】
来源:互联网 发布:新华书店淘宝旗舰店 编辑:程序博客网 时间:2024/06/07 14:22
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15359 Accepted Submission(s): 7525
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 <stdio.h>#include <string.h>#define maxn 1010int pre[maxn];int ufind(int x) {return pre[x] == -1 ? x : (pre[x] = ufind(pre[x]));}bool unite(int x, int y) {x = ufind(x);y = ufind(y);if (x == y) return false;pre[x] = y;return true;}int main() {freopen("stdin.txt", "r", stdin);int T, n, m, i, cnt, x, y;scanf("%d", &T);while (T--) {scanf("%d%d", &n, &m);memset(pre, -1, sizeof(int) * (n + 1));cnt = n;while (m--) {scanf("%d%d", &x, &y);if (unite(x, y)) --cnt;}printf("%d\n", cnt);}return 0;}
0 0
- HDU1213 How Many Tables 【标准并查集】
- 【hdu1213】How Many Tables【并查集】
- How Many Tables hdu1213 并查集
- hdu1213(How Many Tables 并查集)
- Hdu1213 - How Many Tables - 并查集
- HDU1213 How Many Tables 【并查集】
- HDU1213 How Many Tables【并查集】
- HDU1213 How Many Tables 【并查集】
- hdu1213 How Many Tables(并查集)
- How Many Tables--hdu1213(并查集)
- HDU1213-How Many Tables 并查集
- HDU1213 How Many Tables - 并查集
- hdu1213 How Many Tables 并查集
- HDU1213 How Many Tables(并查集)
- HDU1213 How Many Tables 并查集
- hdu1213 How Many Tables 并查集
- HDU1213 How Many Tables(并查集)
- hdu1213 How many tables 并查集
- log file sync p1 p2 p3
- max232接法详解
- @JsonIgnoreProperties(value={"hibernateLazyInitializer"}) 属性
- JAVA之旅——重温Java关键词2
- STM32F411RE Nucleo笔记-按键控制PWM占空比
- HDU1213 How Many Tables 【标准并查集】
- SDL 1.2版本显示YUYV422数据
- 【树形DP】Centroid
- [JNI]如何在ANDROID JNI 的C++中打Log
- 关于linux kernel里的high memory
- Controlling How NSThread and NSRunLoop Exit
- IOS中的WebView
- Sicily 1036. Crypto Columns
- 读取JSON字符串,转为XML文件(二)