九度 题目1445:How Many Tables
来源:互联网 发布:大数据医疗行业的挑战 编辑:程序博客网 时间:2024/05/18 18:03
- 题目1445:How Many Tables
时间限制:1 秒
内存限制:128 兆
特殊判题:否
提交:393
解决:252
- 题目描述:
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.
- 输入:
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.
- 输出:
For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.
- 样例输入:
25 31 22 34 55 12 5
- 样例输出:
24
- 用并查集求连通分量的个数
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int r[1004];
int Findroot(int x)
{
if(r[x]==-1) return x;
else return Findroot(r[x]);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n,m,s=0;
scanf("%d%d",&n,&m);
for(int i=0;i<=n;i++)
r[i]=-1;
for(int j=0;j<m;j++)
{
int a,b;
scanf("%d%d",&a,&b);
a=Findroot(a);
b=Findroot(b);
if(a!=b)
r[a]=b;
}
for(int i=1;i<=n;i++)
if(r[i]==-1)
s++;
printf("%d\n",s);
}
return 0;
}
- 【九度】题目1445:How Many Tables
- 九度 题目1445:How Many Tables
- 九度 题目1445:How Many Tables
- 九度oj 题目1445:How Many Tables
- 【九度OJ】题目1445:How Many Tables 解题报告
- 题目1445:How Many Tables 九度OJ
- 九度OJ-1445:How Many Tables
- 题目1445:How Many Tables
- 题目1445:How Many Tables
- 题目1445:How Many Tables
- 题目69:How Many Tables
- hdu 题目 题目1213 How Many Tables
- How Many Tables
- HDOJ How Many Tables
- hduoj1213:How Many Tables
- hdu How Many Tables
- HDU1213:How Many Tables
- HDU1213--How Many Tables
- 正在学习的知识网址集合
- CC2430 CC2530 AD转换分辨率之“争”
- Java调用C/C++编写的第三方dll动态链接库(非native API)--- JNI
- 第二周周作业
- Ubuntu下mini2440的环境搭建-截图记录
- 九度 题目1445:How Many Tables
- Object-c ios7中方法定义的注意点
- 第二周作业
- 【转载】浅谈C中的malloc和free
- 第二周作业
- C++第一次作业
- 一个 Rails 表单样式设置的小技巧
- ListView的分组实现
- 使用ViewPage时ViewPage中的页面重置问题