PAT A1034 Head of a Gang (30 分) 图 连通块 并查集

    题目大意：给出图的信息，以及每条边的边权、每个顶点的点权。寻找满足以下条件的连通块：① 顶点数大于2 ②边权之和大于给定值K。 ③选择点权最大的顶点作为该连通块的head。最后输出所有符合要求的连通块的head及连通块内的总顶点数。

    与常规连通块问题有所不同的是，这里要累计边权和顶点数。如果在dfs之前首先判断该顶点是否被访问过的话，那么如果图中有环，在访问最后一个顶点时就会因为所有顶点都被访问过了，而丢失最后一条边的信息。测试用例中的 EEE FFF HHH就是这个情况。要解决这个问题，就需要在 dfs的判断条件删去该顶点是否访问过，直接对所有与之相连的顶点进行访问。但相应的，需要在累加上边权后将边权置零，防止重复累加。同时，因为需要累计顶点数量，需要在累加顶点数之前，判断该顶点是否被访问过。

AC代码如下：

#include <iostream>
#include <map>

using namespace std;

const int MAXN = 2010;
int G[MAXN][MAXN] = {0};
int W[MAXN] = {0};
bool visited[MAXN] = {false};

void dfs(int v, int &head, int &totalMembers, int &totalWeight, int N)
{
    visited[v] = true;
    if(W[head] < W[v]) head = v;
    for (int i = 0; i < N; ++i)
    {
        if(G[v][i] > 0)
        {
            if(!visited[i]) totalMembers++;
            totalWeight += G[v][i];
            G[v][i] = G[i][v] = 0;
            dfs(i, head, totalMembers, totalWeight, N);
        }
    }
}

map<string, int> nameToId;
map<int, string> idToName;
map<string, int> headMp;
int getId(string name, int &people)
{
    if(nameToId.find(name) != nameToId.end()) return nameToId[name];
    nameToId[name] = people;
    idToName[people] = name;
    return people++;
}

int main()
{
    int N, K;
    cin >> N >> K;
    int people = 0;
    for (int i = 0; i < N; ++i)
    {
        string name1, name2;
        int time;
        cin >> name1 >> name2 >> time;
        int id1 = getId(name1, people), id2 = getId(name2,people);
        G[id1][id2] += time;
        G[id2][id1] += time;
        W[id1] += time;
        W[id2] += time;
    }
    for (int i = 0; i < people; ++i)
    {
        if(!visited[i])
        {
            int head = i, totalMembers = 1, totalWeight = 0;
            dfs(i, head, totalMembers, totalWeight, people);
            if(totalWeight > K && totalMembers > 2) headMp[idToName[head]] = totalMembers;
        }
    }
    cout << headMp.size() << endl;
    for(map<string, int>::iterator it = headMp.begin(); it != headMp.end(); it++)
    {
        cout << it->first << " " << it->second << endl;
    }
    return 0;
}

或者用并查集来做，思路更简单一些。每条通话记录的两方属于同一个集合，遍历所有id，统计属于同一个集合的id，该集合的总通话时间是所有人的通话时间之和除以2，要输出的该集合的head是权重最大的那个。

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2010;
int parent[MAXN];
int weight[MAXN] = {0};
map<string, int> nameToId;
map<int, string> idToName;
map<string, int> headToMembers;
bool checked[MAXN] = {false};
int people = 0;
int getId(string name)
{
    if(nameToId.find(name) != nameToId.end()) return nameToId[name];
    nameToId[name] = people;
    idToName[people] = name;
    return people++;
}

int findParent(int p)
{
    while(p != parent[p])
    {
        parent[p] = parent[parent[p]];
        p = parent[p];
    }
    return p;
}

void unionElements(int a, int b)
{
    int pa = findParent(a);
    int pb = findParent(b);
    parent[pb] = pa;
}

int main()
{
    for (int i = 0; i < MAXN; ++i)
    {
        parent[i] = i;
    }
    int N, K;
    cin >> N >> K;
    for (int i = 0; i < N; ++i)
    {
        string name1, name2;
        int w;
        cin >> name1 >> name2 >> w;
        int u = getId(name1), v = getId(name2);
        weight[u] += w;
        weight[v] += w;
        unionElements(u, v);
    }
    for (int i = 0; i < people; ++i)
    {
        parent[i] = findParent(i);
    }
    for (int i = 0; i < people; ++i)
    {
        if(!checked[i])
        {
            checked[i] = true;
            int pi = findParent(i);
            int totalWeight = weight[i];
            int totalMembers = 1;
            int head = i;
            for (int j = i + 1; j < people; ++j)
            {
                if(!checked[j] && parent[j] == pi)
                {
                    checked[j] = true;
                    totalMembers++;
                    totalWeight += weight[j];
                    if(weight[j] > weight[head]) head = j;
                }
            }
            totalWeight /= 2;
            if(totalMembers > 2 && totalWeight > K) headToMembers[idToName[head]] = totalMembers;
        }
    }
    printf("%d\n", headToMembers.size());
    for(auto it = headToMembers.begin(); it != headToMembers.end(); it++)
    {
        printf("%s %d\n", it->first.c_str(), it->second);
    }
    return 0;
}