HDU1213How Many Tables
来源:互联网 发布:里海运河知乎 编辑:程序博客网 时间:2024/06/14 11:06
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
Hint
题意
题解:
其实可以直接par[i]==i判断的有几个不一样的根节点 就有几个不联通的
AC代码
#include<cstdio>#include<cstring>#include<stack>#include <set>#include <queue>#include <vector>#include<iostream>#include<algorithm>using namespace std;typedef long long LL;const int mod = 1e9+7;int par[1005];int vis[1005];int n,m;void init(int n){ for (int i = 1;i <= n; ++i){ par[i] = i; }}int fd(int x){ if (x == par[x]) return x; return par[x] = fd(par[x]);}void ut(int x,int y){ int tx = fd(x); int ty = fd(y); if (tx!=ty){ par[tx] = ty; }}int main(){ int t; scanf("%d",&t); while (t--){ memset(vis,0,sizeof(vis)); scanf("%d%d",&n,&m); init(n); int x,y; while (m--){ scanf("%d%d",&x,&y); ut(x,y); } int sum = 0; for (int i = 1;i <= n; ++i){ if (!vis[fd(i)]){ vis[fd(i)]=1; sum++; } } printf("%d\n",sum); } return 0;}
- HDU1213How Many Tables
- hdu1213How Many Tables 基础题
- hdu1213How many tables 并查集基础
- hdu1213How Many Tables【并差集】
- hdu1213How Many Tables(并查集)
- hdu1213How Many Tables 并查集
- hdu1213How Many Tables (并查集裸题)
- 【并查集】HDU1213How Many Tables【模板题】
- HDU1213How Many Tables 并查集路径压缩
- How Many Tables
- HDOJ How Many Tables
- hduoj1213:How Many Tables
- hdu How Many Tables
- HDU1213:How Many Tables
- HDU_1213_How Many Tables(並查集)
- HDU1213--How Many Tables
- hdu1213-How Many Tables
- hdu1213 How Many Tables
- 利用反射完成一个类中,属性的批量赋值操作
- Dining POJ
- 12、字符串反转
- orcale查看被锁定的表
- 树
- HDU1213How Many Tables
- Genealogical tree POJ
- canvas篇(1)
- [LeetCode]100. Same Tree--判断二叉树是否相同
- hihocoder第72周 数论一·Miller-Rabin质数测试(Miller-Rabin质数测试)
- 高德地图多边形方式POI提取
- 搭建虚拟机:基于VMDK(虚拟机VMware创建的虚拟硬盘格式)
- SpringMVC前传(1)
- GPU编程自学2 —— CUDA环境配置