杭电1213 How Many Tables(并查集)
来源:互联网 发布:js小图传给大图 编辑:程序博客网 时间:2024/05/18 03:05
/*
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11970 Accepted Submission(s): 5856
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>#define maxn 2000int father[maxn];int find(int x){ return x==father[x]?x:father[x]=find(father[x]);}int main(){ int n,a,b,i; int N,m,num; scanf("%d",&N); while(N--) { num=0; scanf("%d%d",&n,&m); for(i=1;i<=n;i++) { father[i]=i; // printf("%d ",i); } for(i=1;i<=m;i++) { scanf("%d%d",&a,&b); a=find(a);b=find(b);father[a]=b; // printf("father%d=%d\n",a,b); } for(i=1;i<=n;i++) { // printf("father[%d]=%d\n",i,father[i]); if(father[i]==i) num++; } printf("%d",num); // if(N) printf("\n"); }return 0;}
0 0
- 杭电1213 How Many Tables(并查集)
- 杭电hdu 1213 How Many Tables并查集
- hdu杭电1213 How Many Tables【并查集】
- 杭电 1213 How Many Tables 并查集
- 杭电 hdu 1213 How Many Tables (并查集,简单题)
- 杭电 hdu 1213 How Many Tables(经典并查集 基础题)
- 杭电-1213 How Many Tables?(并查集模板)
- 并查集-杭电1213-How Many Tables-难度1
- 杭电oj1213——How Many Tables(并查集)
- How Many Tables(并查集)
- How Many Tables(并查集)
- How Many Tables(并查集)
- 杭电1213 How Many Tables(并查集找根节点)
- 杭电 1213 hao many tables(并查集)
- HDU 1213 How Many Tables(并查集)
- hdu 1213 How Many Tables(并查集练习)
- [ACM] hdu 1213 How Many Tables(并查集)
- [ACM] hdu 1213 How Many Tables(并查集)
- BZOJ 1426 收集邮票
- Office文件在线预览功能够折腾的了
- Visaul Studio 常用快捷键的动画演示
- Oracle11G 用imp导入数据
- android启动界面
- 杭电1213 How Many Tables(并查集)
- php empty()和isset()的区别
- Google Guice 接口多实现 注入
- cocos3.0使用cocostudio动画帧结合地图对象键值创建精灵动画
- poj2983 Is the Information Reliable
- Windows 7 硬盘安装正确方法 不用刻盘
- 在网页上启动你的应用程序
- 安装树莓派 Raspberry PI
- mac地址转换