hdu 1213 How Many Tables
来源:互联网 发布:淘宝店铺标志在哪 编辑:程序博客网 时间:2024/04/29 13:56
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5945 Accepted Submission(s): 2817
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
Source
杭电ACM省赛集训队选拔赛之热身赛
Recommend
Eddy
直接并查集模版
#include<stdio.h>#include<string.h>int pre[1005];int ans,n,m;int find(int x){ if(x!=pre[x]) pre[x]=find(pre[x]); return pre[x];}void init(int x){ memset(pre,0,sizeof(pre)); for(int i=0;i<x;i++) pre[i]=i;}int main(){ int T,i,t1,t2; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); init(n); ans=n; for(i=1;i<=m;i++) { scanf("%d%d",&t1,&t2); t1=find(t1);t2=find(t2); if(t1!=t2) { pre[t1]=t2; ans--; } } printf("%d\n",ans); } return 0;}
- hdu 1213 how many tables
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- Hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- hdu 1213 How Many Tables
- HDU 1213 how many tables
- hdu 1213 How Many Tables
- hdu 1213how many tables
- hdu 1213 How Many Tables
- Hdu 1213 - How Many Tables
- HDU 1213 How Many Tables
- HDU 1213 How Many Tables
- hdu 1213 How Many Tables
- abstract class和interface有什么区别
- Outlook 开机启动并最小化到托盘
- Git 常用命令
- App Widget 学习总结(更新。。。)
- hdu 1232 畅通工程
- hdu 1213 How Many Tables
- C语言和设计模式(迭代器模式)
- C语言和设计模式(外观模式)
- C语言和设计模式(代理模式)
- C语言和设计模式(享元模式)
- C语言和设计模式(装饰模式)
- C语言和设计模式(适配器模式)
- hdu 1856 More is better
- CERN openlab Student Programme