HDU 1213 How Many Tables
来源:互联网 发布:免费宝贝复制软件 编辑:程序博客网 时间:2024/06/03 18:40
HDU 1213 How Many Tables
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.
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
2
5 3
1 2
2 3
4 5
5 1
2 5
Sample Output
2
4
并查集的简单应用,就是计算一共有多少个集合,也就是数有多少根节点
水题,直接上代码
#include<iostream>#include <algorithm>#include <cstdio>#define N 1005using namespace std;int u[N], ran[N], n, m;void init(){ for(int i = 1; i <= n; i++) { u[i] = i; ran[i] = 1; }}int find(int x){ if (x != u[x]) { u[x] = find(u[x]); } return u[x];}void un(int x, int y){ x = find(x); y = find(y); if (x == y) { return ; } if (ran[x] > ran[y]) { u[y] = x; } else { u[x] = y; if (ran[x] == ran[y]) { ran[y]++; } }}int main(){#ifndef ONLINE_JUDGE freopen("1.txt", "r", stdin);#endif int a, b, t, i, j; cin >> t; while (t--) { cin >> n >> m; init(); for (i = 0; i < m; i++) { cin >> a >> b; un(a, b); } a = 0; for (i = 1; i <= n; i++) { if (i == u[i]) { a++; } } cout << a << endl; } return 0;}
- 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
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 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 5391 Zball in Tina Town(数论——威尔逊定理)——BestCoder Round #51(div.2)
- 刀哥多线程同步任务作用gcd-07-sync_task
- Oracle数据库表被锁
- 技术与经济之六:现代化的陷阱
- 设计模式--浅谈
- HDU 1213 How Many Tables
- 去哪网实习总结:定时发送邮件(JavaWeb)
- 模板函数的名称修饰
- iOS开发核心语言Objective C语言 —— 特有语法及设计模式
- 如何挑选老师
- 【甘道夫】新的阶段
- 基于Android MPAndroidChart实现腾讯QQ群数据统计报表核心功能
- cocos2d-x开发日志04 ——计划任务
- 刀哥多线程Barrier异步gcd-08-barrier_async