HDU 1213【】How Many Tables(并查集)
来源:互联网 发布:淘宝客服的等级工资 编辑:程序博客网 时间:2024/05/20 20:56
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 <iostream>#include <cstdio>using namespace std;int sum, n, m;int p[1000];void makeset(int x){for(int i=1; i<=x; i++)p[i]=i;}int findset(int x){if(x!=p[x])p[x]=findset(p[x]);return p[x];}void unin(int a, int b){int x=findset(a);int y=findset(b);if(x==y)return;sum=sum-1;p[y]=x;}int main(){int t;scanf("%d", &t);for(int j=1; j<=t; j++){scanf("%d%d", &n, &m);sum=n;makeset(n);int a, b;for(int i=1; i<=m; i++){scanf("%d%d", &a, &b);unin(a, b);}printf("%d\n", sum);}return 0;}
0 0
- 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(并查集)
- 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(并查集)
- jquery 获取 自定义属性(attr 和 prop)
- 改变链接的样式
- CentOS6.6上安装phpMyAdmin,在浏览器访问得到403错误解决办法
- Maximum Gap
- Java集合的总体框架
- HDU 1213【】How Many Tables(并查集)
- hdoj.1433 Simply Syntax【递归调用】 2015/04/24
- C++设计模式之——Factory模式
- 清除VS2010最近打开记录脚本
- [Hadoop源码解读](五)MapReduce篇之Writable相关类
- ExtJS4.2 panel不显示滚动条问题
- Allow Users to Authenticate With Username Only Using Devise, ActiveAdmin, Rails 4 and Ruby 2
- clearfix:after 清除css浮动
- 关于fragment显示和隐藏的说明