Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 49377
Accepted Submission(s): 24555
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
问题链接:https://vjudge.net/problem/19354/origin
问题简述:如果A认识B,B认识C,则认为ABC互相认识,不认识的人不坐在同一张桌子上,找出一共需要多少张桌子。
问题分析:并查集
程序说明:主要分为三个步骤:一、生成单元集;二、将有联系的单元集进行合并;三、找出新合并的单元集所属的父节点。
ac代码如下
#include<iostream>
using namespace std;
int arr[1050];
void make_set(int x)
{
arr[x] = x;
}
int find_set(int x)
{
if (arr[x] == x)
return arr[x];
else
find_set(arr[x]);
}
void union_set(int x,int y)
{
int a = find_set(x);
int b = find_set(y);
if (a != b)
arr[b] = a;
}
int main()
{
int T;
cin >> T;
while (T--)
{
int n, m, p1, p2, t=0;
cin >> n >> m;
for (int i = 0; i <= n; i++)
make_set(i);
for (int i = 0; i < m; i++)
{
cin >> p1 >> p2;
union_set(p1, p2);
}
for (int i = 1; i <= n; i++)
if (arr[i] != i)
t++;
cout << n - t<<endl;
}
}