hdoj 1213 How Many Tables
来源:互联网 发布:3d彩票预测软件 编辑:程序博客网 时间:2024/05/16 12:56
/*
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13276 Accepted Submission(s): 6494
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>
int s[1100];
void f(int a)
{
int i;
for(i=1;i<=a;i++)
s[i]=i;
}
int g(int m)
{
return s[m]==m?m:s[m]=g(s[m]);
}
int h(int c,int d)
{
int x,y;
x=g(c);
y=g(d);
if(x!=y)
s[x]=y;
}
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
int a,b,i,j;
scanf("%d%d",&a,&b);
f(a);
for(i=1;i<=b;i++)
{
int c,d;
scanf("%d%d",&c,&d);
h(c,d);
}
int cont=0;
for(i=1;i<=a;i++)
{
if(s[i]==i)
cont++;
}
printf("%d\n",cont);
}
return 0;
}
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 13276 Accepted Submission(s): 6494
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>
int s[1100];
void f(int a)
{
int i;
for(i=1;i<=a;i++)
s[i]=i;
}
int g(int m)
{
return s[m]==m?m:s[m]=g(s[m]);
}
int h(int c,int d)
{
int x,y;
x=g(c);
y=g(d);
if(x!=y)
s[x]=y;
}
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
int a,b,i,j;
scanf("%d%d",&a,&b);
f(a);
for(i=1;i<=b;i++)
{
int c,d;
scanf("%d%d",&c,&d);
h(c,d);
}
int cont=0;
for(i=1;i<=a;i++)
{
if(s[i]==i)
cont++;
}
printf("%d\n",cont);
}
return 0;
}
0 0
- HDOJ 1213 How Many Tables
- hdoj 1213 How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- hdoj 1213 How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- hdoj 1213 How Many Tables
- hdoj-1213-How Many Tables
- HDOJ-1213 How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- HDOJ-1213-How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- HDOJ How Many Tables
- ACM HDOJ 1213 (How Many Tables )
- HDOJ-1213 How Many Tables(包含题意)
- mark一个
- 【Oracle练习】④第5章 多表查询
- 【拓扑排序】poj 1094_Sorting It All Out_201408081725
- hdoj 1232 畅通工程
- ios 程序异常捕获
- hdoj 1213 How Many Tables
- Unity3D Android的配置文件
- 【Oracle练习】⑤第6章 分组函数
- db2codepage设置
- unity3D的数据库连接操作
- 【Oracle练习】⑥第7章 子查询
- 概念:二元查找树
- mac 下终端访问文件出现“Permission Denied”解决方案
- MKMapView地理编码(即根据地址来转换成坐标)