hdu1213How Many Tables (并查集裸题)
来源:互联网 发布:软件外部接口设计 编辑:程序博客网 时间:2024/05/21 07:56
思路:不说了..模板题
#include <cstdio>#include <queue>#include <cstring>#include <iostream>#include <cstdlib>#include <algorithm>#include <vector>#include <map>#include <string>#include <set>#include <ctime>#include <cmath>#include <cctype>using namespace std;#define maxn 100000#define LL long longint cas=1,T;int pre[1005];int Find(int x){int r = x;while (r!=pre[r])r=pre[r];int i = x,j;while (pre[i]!=r){j=pre[i];pre[i]=r;i=j;}return r;}void mix(int x,int y){int fx = Find(x),fy=Find(y);if (fx!=fy){pre[fy]=fx;}}int main(){//freopen("in","r",stdin);scanf("%d",&T);while (T--){int n,m;scanf("%d%d",&n,&m);for (int i = 1;i<=n;i++)pre[i]=i;for (int i = 0;i<m;i++){int a,b;scanf("%d%d",&a,&b);mix(a,b);}int ans = 0; for (int i = 1;i<=n;i++)if (pre[i]==i)ans++;printf("%d\n",ans);memset(pre,0,sizeof(pre));}//printf("time=%.3lf",(double)clock()/CLOCKS_PER_SEC);return 0;}
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
0 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 基础题
- HDOJ1213 How Many Tables 并查集裸题
- hdoj1213How Many Tables(并查集)
- How Many Tables(并查集)
- How Many Tables(并查集)
- How Many Tables(并查集)
- How Many Tables hdu1213(并)
- HDU 1213 How Many Tables(并查集)
- HDU1213 How Many Tables(简单的并查集)
- hdu 1213 How Many Tables(并查集练习)
- CNN中各层图像大小的计算
- Android进阶之路——自定义NumberPicker
- perl weixin 登陆
- poj2836(状态压缩dp)
- 冬令营整理
- hdu1213How Many Tables (并查集裸题)
- 将DLL和EXE打包成一个EXE
- thinkphp CURD
- 数据结构学习心得总结
- JavaScript设计模式学习笔记2
- SSH連現時出現「WARNING: REMOTE HOST IDENTIFICATION HAS CHANGED!」解決辦法
- 堆与堆排序
- EM算法
- FLV文件格式解析