经典的并查集之How Many Tables
来源:互联网 发布:魅蓝note6无电信网络 编辑:程序博客网 时间:2024/06/07 04:55
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
<span style="font-size:18px;">#include <iostream>#include<cstdio>#include<cstdlib>using namespace std;int pre[20010];<span style="color:#00cccc;background-color: rgb(255, 255, 0);">void init (int n)</span><span style="background-color: rgb(255, 255, 0);"></span><span style="color:#ffffff;background-color: rgb(255, 153, 255);">{</span> int i; for(i=0;i<=n;i++) pre[i]=i;}<span style="background-color: rgb(255, 204, 0);">int Find(int x)//寻找根节点</span>{ int root=x; while(pre[root]!=root) root=pre[root]; int cur=x,tmp; while(cur!=root) { tmp=pre[cur]; pre[cur]=root; cur=tmp; } return root;}<span style="background-color: rgb(255, 255, 0);">void Union(int x,int y)//合并两个子节点</span>{ int fx=Find(x); int fy=Find(y); if(fx!=fy) pre[fx]=fy;}int main(){ int t,n,m,a,b; cin>>t; while(t--) { cin>>n>>m; init(n); while(m--) { cin>>a>>b; Union(a,b); } int ans=n; for(int i=1;i<=n;i++) { if(Find(i)!=i) ans--; } cout<<ans<<endl; } return 0;}</span>
0 0
- 经典的并查集之How 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 【并查集】
- 并查集---How Many Tables
- HDU1213 How Many Tables【并查集】
- HDU1213 How Many Tables 【并查集】
- [并查集]How Many Tables
- hdu1213 How Many Tables(并查集)
- hdoj How Many Tables【并查集】
- hdoj1213 How many tables?(并查集)
- How Many Tables-并查集
- HDOJ1213 How Many Tables(并查集)
- How Many Tables--hdu1213(并查集)
- SGU - 154 - Factorial (数论)
- Scala-3 - 4 - Lecture 2.4 - Scala Syntax Summary (4_13)
- 浅析java反射机制
- Loop in List(链表中的圈)
- Ubuntu下载Android2.3+5.0系统源码
- 经典的并查集之How Many Tables
- Mysql Solution - Timeout error occurred trying to stop MySQL Daemon. Stopping MySQL: [FAILED] -
- linux 添加环境变量
- Oracle_12c 非容器数据库安装和pde格式的数据导入
- java代码块
- hadoop伪分布式条件下出现的权限问题
- 从12306免费验证身份证号码与姓名是否一致
- J2EE工程
- 两步轻松解决在VMware下面的linux不能使用U盘的问题