How Many Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24000 Accepted Submission(s): 11979
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.
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
Author
Ignatius.L
题意:菇凉要过生日,请朋友们吃饭,不认识的盆友不能坐在同一个桌子,间接认识也行...
分析:
并查集的最简单的例题。。。将认识的归为一个集合,最后看father[i]==i的有几组,就需要几张桌子;
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <iostream>
using namespace std;
#define N 1100
int father[N];
int n,m;
int Find(int x)
{
while(x!=father[x])
x=father[x];
return x;
}
void join(int a,int b)
{
int x,y;
x=Find(a);
y=Find(b);
if(x!=y)
{
if(x>y)
father[y]=x;
else
father[x]=y;
}
}
int main()
{
int T,i,a,b;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&n,&m);
for(i=1; i<=n; i++)
father[i]=i;
for(i=1; i<=m; i++)
{
scanf("%d%d",&a,&b);
join(a,b);
}
int ans=0;
for(i=1;i<=n;i++)
if(father[i]==i)
ans++;
printf("%d\n",ans);
}
return 0;
}