HDU1213How Many Tables 并查集路径压缩
来源:互联网 发布:淘宝怎么看卖家信誉度 编辑:程序博客网 时间:2024/05/29 17:36
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
题意:t组数据,n个人,找相互认识的人拼成一桌,求一共几桌
思路:并查集典型,需要的圆桌的个数=根节点的个数 路径优化一下
#include<iostream>#include<stdlib.h>#include<stdio.h>#include<cmath>#include<algorithm>#include<string>#include<string.h>#include<set>#include<queue>#include<stack>#include<vector>#include<functional> #include<map>using namespace std;int father[1005];//储存i的father父节点int t;int ans;void makeSet() {for (int i = 0; i < 1005; i++) father[i] = i;}int Find(int x) {//路径压缩 迭代 最优版int root = x; //根节点while (root != father[root]) { //寻找根节点root = father[root];}while (x != root) {int tmp = father[x];father[x] = root; //根节点赋值x = tmp;}return root;}void Union(int x, int y) {int a;int b;a = Find(x);b = Find(y);father[b] = a;}int main(){cin >> t;while (t--) {int a, b;int n, m;makeSet();ans = 0;scanf("%d %d", &n, &m);for (int i = 1; i <= m; i++) {scanf("%d %d", &a, &b);Union(a, b);}for (int i = 1; i <= n; i++) {if (i == father[i]) ans++;}cout << ans << endl;}system("pause");return 0;}
0 0
- HDU1213How Many Tables 并查集路径压缩
- hdu1213How many tables 并查集基础
- hdu1213How Many Tables(并查集)
- hdu1213How Many Tables 并查集
- 【并查集】HDU1213How Many Tables【模板题】
- hdu1213How Many Tables【并差集】
- HDU 1213 How Many Tables 并查集路径压缩
- hdu1213How Many Tables (并查集裸题)
- hdu 1213 How Many Tables 并查集模板题+路径压缩
- HDU1213How Many Tables
- hdu1213How Many Tables 基础题
- 【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 【并查集】
- Nginx入门简介
- PHP_SAPI
- 纯JS省市二级联动Demo
- Java 数组转换为List,List转数组,要怎么办。
- Lua常用函数
- HDU1213How Many Tables 并查集路径压缩
- 线程调度策略
- [CDOJ 1337]郭大侠与阴阳家
- 使用HTTPS与SSL来保证安全性
- Redis in Python-----redis module
- String 之字符串与内存管理
- 烤鸭的Source Insight学习笔记
- helloworld小程序--eclipse
- 入门