杭电1213--How Many Tables（并查集）-优快云博客

本文介绍了一种使用并查集解决社交聚会中桌次分配的问题，通过分析朋友之间的相互认识关系，计算最少需要多少张桌子来容纳所有朋友，确保每个人都能与已认识的人同桌。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

How Many Tables

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 18006 Accepted Submission(s): 8856

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

Author

Ignatius.L

Source

杭电ACM省赛集训队选拔赛之热身赛

Recommend

Eddy | We have carefully selected several similar problems for you: 1856 1325 1198 1102 1162

//格式略坑；

#include <stdio.h>
int father[1010];

int find(int a)
{
    int k, j, r;
    r = a ;
    while(r != father[r])
    r = father[r];
    k = a;
    while(k != r)
    {
        j = father[k];
        father[k] = r;
        k = j;
    }
    return r;
} 
/*int find(int a)
{
    while(father[a] != a)
    father[a] = find(father[a]);
    return father[a];
} */
void mercy(int a, int b)
{
    int p = find(a);
    int q = find(b);
    if(p != q)
    father[p] = q;
}

int main()
{
    int i, t; 
    scanf("%d", &t);
    while(t--)
    {
        int n, m, a, b;
        scanf("%d %d", &n, &m);
        for(i=1; i<=n; i++)
        father[i] = i;
        for(i=0; i<m; i++)
        {
            scanf("%d %d", &a, &b);
            mercy(a, b);
        }
        //printf("\n");
        int total = 0;
        for(i=1; i<=n; i++)
        {
            if(father[i] == i)
            total++;
        }
        printf("%d\n", total);
    }
    return 0;
}