hdoj1213 How many tables?(并查集)
来源:互联网 发布:期货量化交易 人工智能 编辑:程序博客网 时间:2024/05/17 21:41
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18166 Accepted Submission(s): 8943
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<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;#define maxn 1100int N,M,sum;int per[maxn];void init(){for(int i=1;i<=N;i++)per[i]=i;}int find(int x){if(x==per[x]) return x;return per[x]=find(per[x]);}void join(int a,int b){int fa=find(a);int fb=find(b);if(fa!=fb) per[fa]=fb;}int main(){int T,A,B;scanf("%d",&T);while(T--){scanf("%d%d",&N,&M);init();while(M--){scanf("%d%d",&A,&B);join(A,B);}sum=0;for(int i=1;i<=N;i++) if(i==per[i]) sum++;printf("%d\n",sum);}return 0;}
0 0
- hdoj1213 How many tables?(并查集)
- HDOJ1213 How Many Tables(并查集)
- 【HDOJ1213】How Many Tables[并查集模板题]
- HDOJ1213. How many tables(并查集连通块计数)
- HDOJ1213 How Many Tables 并查集裸题
- How Many Tables<hdoj1213>
- 【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(并查集)
- 数据结构之---C语言实现图的十字链表存储表示
- Snail—UI学习之弹出按钮选择项UIActionSheet
- [Cocoa]_[初级]_[NSTableView之自定义NSImageButtonCell]
- JavaScript replaceall 方法
- 聊天工具条
- hdoj1213 How many tables?(并查集)
- Java(07—29)学习总结
- 【交换安全】DAI - Dynamic ARP Inspection 详解
- source sh执行脚本的区别
- 2120 Ice_cream's world I
- 关于Java的常见误解
- madplay系统移植
- 《现代操作系统》精读与思考笔记 第二章 进程和线程
- 给数组对象sort函数传递比较函数参数的一点反思