杭电1213 How Many Tables(并查集)
2014-05-01 23:22
501 查看
/*
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.
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
2 5 3 1 2 2 3 4 5 5 1 2 5
Sample Output
2 4
*/
#include<stdio.h> #define maxn 2000 int 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; }
相关文章推荐
- <csapp> bomb lab (《深入理解计算机系统》lab2)
- cocos3.0使用cocostudio动画帧结合地图对象键值创建精灵动画
- 不同浏览器的CSS Hacks技术
- HDU 4786 Fibonacci Tree(生成树问题)
- Jump Game
- 在网页上启动你的应用程序
- [设计软件] Adobe CC for Mac 全系列简体中文版破解下载 /图米
- spring mvc构建WEB应用程序入门例子
- google glog源码分析
- SSZipArchive使用详解
- [设计模式]原型模式
- CTreeCtrl结点拖动实现(与后台联动)
- BZOJ3236 [Ahoi2013]作业
- ubuntu eclipse下配置C++ 环境
- Oracle11G 用exp导出用户
- Struts2实现文件上传报错(三)
- Windows 7 硬盘安装正确方法 不用刻盘
- Visaul Studio 常用快捷键的动画演示
- 很激动可以在CSDN写博
- Struts2实现文件上传报错(三)