HDOJ 1213 How Many Tables(并查集)
来源:互联网 发布:遗传算法 交叉概率 编辑:程序博客网 时间:2024/05/18 20:47
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17935 Accepted Submission(s): 8813
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<cstdio>int bin[1010];int find(int x){int r=x;while(r!=bin[r]) r=bin[r];return r;}int merge(int a,int b){int fa,fb;fa=find(a);fb=find(b);if(fa!=fb) bin[fa]=fb;}int main(){int t,n,m,i,a,b,k=0;scanf("%d",&t);while(t--){scanf("%d%d",&n,&m);for(i=1;i<=n;i++) bin[i]=i;for(i=0;i<m;i++){scanf("%d%d",&a,&b);merge(a,b);}int count=0;for(i=1;i<=n;i++){if(bin[i]==i) count++;}printf("%d\n",count);}return 0;}
0 0
- hdoj How Many Tables【并查集】
- HDOJ--1213--How Many Tables【并查集】
- HDOJ 1213 How Many Tables——并查集
- Hdoj 1213 How Many Tables 【并查集】
- hdoj-1213-How Many Tables【并查集】
- HDOJ 1213 How Many Tables(并查集)
- HDOJ 1213 How Many Tables(基础并查集)
- hdoj 1213 How Many Tables 【并查集】
- HDOJ 1213 How Many Tables(并查集)
- HDOJ 1213 how many tables (并查集)
- hdoj 1213 How Many Tables【并查集】
- HDOJ 1213 How Many Tables【并查集】
- HDOJ 1213 How Many Tables(并查集)
- HDOJ 1213 How Many Tables(并查集)
- HDOJ 题目1213 How Many Tables(并查集基础)
- hdoj 1213 How Many Tables (并查集||最小生成树)
- HDOJ How Many Tables 1213(入门级并查集)
- 并查集——HDOJ 1213How Many Tables解题报告
- 1027
- JS视频播放
- NYOJ 1057 寻找最大数(三)
- NSString / NSData / char* 类型之间的转换
- linux 之makefile语法学习1
- HDOJ 1213 How Many Tables(并查集)
- 求和
- 【数据库】Truncate的用法
- rdbms迁移到Impala2.0
- Linux系统调用
- IntelliJ IDEA 快捷键
- 共享一个以前写的俄罗斯方块
- js把日期字符串转换成时间戳
- Veriog_Notes_Chapter 2