HDU 1213How Many Tables(基础并查集)
来源:互联网 发布:淘宝订单怎么取消订单 编辑:程序博客网 时间:2024/06/05 16:15
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
这道题 很裸的并查集,每次加到集合里把桌子数减1就好
#include <iostream>#include <cstring>#include <set>#include <cstdio>using namespace std;int f[10006];void init(){ for(int i = 0;i<10005;i++) f[i] = i;}int find(int x){ if(f[x]!=x) f[x] = find(f[x]); return f[x];}bool join(int x,int y){ int p = find(x); int q = find(y); if(p!=q){ f[p] = q; return true; } return false;}int main(){ int n; cin>>n; while(n--) { init(); int ans,m; cin>>ans>>m; while(m--) { int x,y; cin>>x>>y; if(join(x,y))ans--; } if(ans == 0)cout<<"1"<<endl; else cout<<ans<<endl; // getchar(); } return 0;}
阅读全文
0 0
- 【hdu 1213 基础并查集】How Many Tables
- HDU 1213How Many Tables(基础并查集)
- HDU 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(并查集学习)
- ubuntu安装 SVN
- TemplateInputException:template might not exist or might not be accessible
- Java在WEB项目中获取文件路径
- LeedCode 之 SameTree
- C++语言发展历史
- HDU 1213How Many Tables(基础并查集)
- “一个程序员的成长史”系列答读者问(2)
- 关于freemarker生成Excel的报错问题解决
- 一、RxJava基础 ---创建操作(Creating Observables)
- win7下配置IIS以及错误模块“ManagedPipelineHandler”解决方法
- mybatis 中 foreach collection的值
- centos下的vi编辑器的使用
- 怎样学好php
- 旋转矩阵推导