How Many Tables<hdoj1213>
2016-08-02 08:39
274 查看
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 pre[1001];
int find(int p)
{
while(p!=pre[p])
{
p=pre[p];
}
return p;
}
void merge(int x,int y)
{
int fx=find(x);
int fy=find(y);
if(fx!=fy)
{
pre[fx]=fy;
}
}
int main()
{
int n,m,t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
pre[i]=i;
}
while(m--)
{
int u,v;
scanf("%d%d",&u,&v);
merge(u,v);
}
int cut=0;
for(int i=1;i<=n;i++)
{
if(pre[i]==i)
{
cut++;
}
}
printf("%d\n",cut);
}
return 0;
}
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 pre[1001];
int find(int p)
{
while(p!=pre[p])
{
p=pre[p];
}
return p;
}
void merge(int x,int y)
{
int fx=find(x);
int fy=find(y);
if(fx!=fy)
{
pre[fx]=fy;
}
}
int main()
{
int n,m,t;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
pre[i]=i;
}
while(m--)
{
int u,v;
scanf("%d%d",&u,&v);
merge(u,v);
}
int cut=0;
for(int i=1;i<=n;i++)
{
if(pre[i]==i)
{
cut++;
}
}
printf("%d\n",cut);
}
return 0;
}
相关文章推荐
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- HDOJ 1213 How Many Tables
- (HDU)1213 How Many Tables
- hdoj-1213-How Many Tables
- HDOJ-1213 How Many Tables
- zoj 3556 How Many Sets I 解题报告 <容斥原理>
- HDOJ 1213 How Many Tables
- hdoj 1213 How Many Tables
- hdoj 1213 How Many Tables
- HDOJ 1213 How Many Tables
- HDU 5137 How Many Maos Does the Guanxi Worth <迪杰斯特拉算法变形>
- 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
- How Many Tables HDU - 1213
- How Many Tables HDU - 1213
- HDU 1213 How Many Tables