Codeup100000615问题 C: How Many Tables

最新推荐文章于 2023-08-07 16:35:05 发布

原创最新推荐文章于 2023-08-07 16:35:05 发布 · 174 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#算法 #数据结构 #c语言 #c++ #并查集

codeup 专栏收录该内容

226 篇文章

订阅专栏

这篇文章探讨了如何根据朋友间的相识关系，通过 Ignatius 生日聚会的场景，确定最少需要的餐桌数。关键在于理解如果A认识B且B认识C，则A、B、C可以坐同一桌。问题涉及利用图论中的并查集来划分朋友群体，确保没有陌生人共处一桌。

题目描述：

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.

输入：

The input starts with an integer T( $\le T \le 25$ ) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M( $\le N,M \le 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( $\neq B$ ), that means friend A and friend B know each other. There will be a blank line between two cases.

输出：

For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.

样例输入：

样例输出：

3
2

实现代码：

#include<cstdio>

const int maxn = 1000 + 10;
int father[maxn];

// 查找根结点
int findFather(int x) {
    int a = x;
    while(x != father[x]) {
        x = father[x];
    }
    while(a != father[a]) {
        int z = a;
        a = father[a];
        father[z] = x;
    }
    return x;
}

// 合并两个集合
void Union(int a, int b) {
    int faA = findFather(a);
    int faB = findFather(b);
    if(faA != faB) {
        father[faA] = faB;
    }
}

// 初始化
void init(int n) {
    for(int i = 1; i <= n; i++) {
        father[i] = i;
    }
}

int main() {
    int t, n, m, a, b;
    while(scanf("%d", &t) != EOF) {
        for(int j = 0; j < t; j++) {
            scanf("%d%d", &n, &m);
            init(n);
            for(int i = 0; i < m; i++) {
                scanf("%d%d", &a, &b);
                Union(a, b);
            }
            int num = 0;
            for(int i = 1; i <= n; i++) {
                if(father[i] == i) {
                    num++;
                }
            }
            printf("%d\n", num);

        }

    }
    return 0;
}