HDU Problem 1213 How Many Tables【并查集】
来源:互联网 发布:法兰克加工中心编程 编辑:程序博客网 时间:2024/05/16 15:50
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24255 Accepted Submission(s): 12119
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省赛集训队选拔赛之热身赛
Recommend
Eddy | We have carefully selected several similar problems for you: 1856 1325 1198 1162 1879
简单的就是在问有几棵树。
#include <bits\stdc++.h>#define MAX_N 1005using namespace std;const int INF = 1e9;const double ESP = 1e-5;int par[MAX_N];void init() { for (int i = 0; i < 1002; i++) { par[i] = i; }}int Find(int x) { if (x == par[x]) return x; return par[x] = Find(par[x]);}void unite(int x, int y) { int fx = Find(x); int fy = Find(y); if (fx != fy) { par[fy] = fx; }}int main() { int n, m, a, b, t; scanf("%d", &t); while (t--) { scanf("%d%d", &n, &m); init(); int ans = 0; for (int i = 0; i < m; i++) { scanf("%d%d", &a, &b); unite(a, b); } for (int i = 1; i <= n; i++) { if (par[i] == i) ans++; } printf("%d\n", ans); } return 0;}
0 0
- HDU Problem 1213 How Many Tables【并查集】
- 并查集 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 (简单并查集)
- android 6.0 创建文件或文件夹失败
- uTron内核原理和服务调用
- VR AR MR
- linux源码Makefile详解(完整)
- hdu 4336 Card Collector
- HDU Problem 1213 How Many Tables【并查集】
- JavaScript数组操作大全
- QWidget基本调色板(背景色,文本色)
- An Introduction to Data Mining
- 数据库-数据库操作(使用FMDB)
- [React Error]: Target container is not a DOM element
- HTTP协议笔记
- This application is modifying the autolayout engine from a background thread, which can lead to engi
- Java四种线程池的使用