【HDU】-1213-How Many Tables(并查集)
2016-08-01 12:04
309 查看
How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24302 Accepted Submission(s): 12156
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<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define CLR(a,b) memset(a,b,siaeof(a))
int f[1010];
int find(int x)
{
if(x!=f[x])
f[x]=find(f[x]);
return f[x];
}
void join(int x,int y)
{
int fx,fy;
fx=find(x);
fy=find(y);
if(fx!=fy)
f[fx]=fy;
}
int main()
{
int u;
scanf("%d",&u);
while(u--)
{
int n,m,root=0;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
f[i]=i;
int a,b;
for(int i=1;i<=m;i++)
{
scanf("%d %d",&a,&b);
join(a,b);
}
for(int i=1;i<=n;i++)
{
if(f[i]==i)
root++;
}
printf("%d\n",root);
}
return 0;
}
相关文章推荐
- HDU 1213 How Many Tables (简单的并查集)
- HDU-1213-How Many Tables(并查集)
- HDU 1213 How Many Tables 并查集
- hdu 1213 How Many Tables(并查集)
- hdu 1213 (How Many Tables)(简单的并查集,纯模板)
- HDU 1213 How Many Tables(并查集)
- HDU - 1213 How Many Tables (简单并查集)
- hdu 1213 How Many Tables(并查集)
- HDU--1213--How Many Tables--并查集
- HDU 1213 How Many Tables(并查集)
- HDU 1213 How Many Tables(并查集)
- HDU 1213 How Many Tables (并查集)
- HDU - 1213 How Many Tables (并查集)
- hdu 1213 How Many Tables 并查集
- HDU 1213 How Many Tables(并查集模板)
- Graph Theory NO.1 HDU_1213_How Many Tables_并查集
- HDU - 1213 How Many Tables解题报告(并查集)
- HDU - 1213 How Many Tables ——并查集
- HDU 1213 How Many Tables(并查集)