(并查集入门)How Many Tables
来源:互联网 发布:java开发的安卓模拟器 编辑:程序博客网 时间:2024/05/18 18:18
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10239 Accepted Submission(s): 5067
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
Author
Ignatius.L
题解: 直接并查集
#include <iostream>#include <cstdio>using namespace std;#define MAX 1005int father[MAX];// 初始化void Make_set(int x){father[x]=x;} // 查找int Find_set(int x){if(x!=father[x])father[x]=Find_set(father[x]);return father[x];}// 合并int Union(int a,int b){a=Find_set(a);b=Find_set(b);if(a==b)return 0;elsefather[b]=a;return 1;}int main(){int n,m,t,i,j,k,sum;scanf("%d",&t);while(t--){sum=0; scanf("%d%d",&n,&m);for(i=1;i<=n;i++)Make_set(i);for(i=1;i<=m;i++){ scanf("%d%d",&j,&k);Union(j,k);}for(i=1;i<=n;i++)if(father[i]==i)sum++;printf("%d\n",sum);}return 0;}
0 0
- (并查集入门)How Many Tables
- How Many Tables(并查集)
- How Many Tables(并查集)
- How Many Tables(并查集)
- HDU 1213 How Many Tables 并查集入门
- HDU1213 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(并查集)
- 移植完RT-Thread之后,串口输出rtc not configured,please configure with set_date and set_time
- Linux版 对普通用户进行审计的示例
- Deep Learning学习(开篇)
- RBAC权限设计实例
- 借助 SublimeLinter 编写高质量的 JavaScript & CSS 代码
- (并查集入门)How Many Tables
- ORCAD生成BOM(元件清单)的方法
- DotNotation(模拟题)
- 解决系统中断占用CPU高的问题
- 内核开发基础——make mrproper及mrproper的含义
- 【算法导论】有向图的深度优先搜索遍历
- 类中 const,static,reference成员的初始化
- eclipse 提示框颜色
- 数字信号处理的学习资源