杭电1213How Many Tables
来源:互联网 发布:微博来自mac客户端 编辑:程序博客网 时间:2024/05/01 12:46
How Many Tables
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uDescription
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<algorithm>using namespace std;int pre[30010];int find(int x){while(x!=pre[x])x=pre[x];return x;}void merge(int x,int y){int fx=find(x);int fy=find(y);if(fx!=fy){if(fx>fy)pre[fx]=fy;elsepre[fy]=fx;}}int main(){int t,n,m,i,ans,a,b;scanf("%d",&t);while(t--){scanf("%d%d",&n,&m);for(i=1;i<=n;i++)pre[i]=i;while(m--){scanf("%d%d",&a,&b);merge(a,b);}ans=0;for(i=1;i<=n;i++)if(find(i)==i)ans++;printf("%d\n",ans);}return 0;}
0 0
- 杭电acm 1213 (How many tables)
- 杭电1213-How Many Tables
- 杭电 1213 How Many Tables
- 【杭电1213】How Many Tables
- 杭电1213How Many Tables
- 【杭电】[1213]How Many Tables
- 杭电1213 How many tables
- 杭电oj--1213 How Many Tables
- 杭电hdu 1213 How Many Tables并查集
- HDOJ 1213 How Many Tables 杭电 ACM
- 杭电1213 How Many Tables(并查集)
- 杭电 HDU ACM 1213 How Many Tables
- hdu杭电1213 How Many Tables【并查集】
- 杭电 1213 How Many Tables 并查集
- 杭电1213 How Many Tables(并查集找根节点)
- 杭电1213How Many Tables与杭电1232大同小异
- How Many Tables 1213
- 1213 How Many Tables
- c#遍历文件夹和文件
- java多线程
- hdu 1568 Fibonacci
- QDUOJ 39 - 签到题(线段树)
- React和Redux的连接react-redux
- 杭电1213How Many Tables
- ios 数组里面的对象都执行一个方法
- GetLastError简介及返回值列表
- 设计模式-工厂方法模式
- HDU Problem 5326 Work 【并查集】
- fatal error: unexpectedly found nil while unwrapping an Optional value
- 各种行程问题
- Apache POI(3):给Excel文件添加打开密码
- JAVA基础问答(一)