题意
题解
求满足 P a r k Park Park 代表的节点(设为节点 1 1 1)度数不超过 S S S 的最小生成树。先考虑除节点 1 1 1 以外的连通分量(设共有 T T T 个)的最小生成森林, K r u s k a l Kruskal Kruskal 求解即可。为了构成最小生成树,需要求出节点 1 1 1 与各连通分量(用并查集中连通分量的根节点表示)的最小边进行连接。接着考虑剩下的 S − T S-T S−T 条边,使生成树边权和更小。
任意一棵最小生成树一定包含无向图中权值最小的边。
上述定理可以通过向树中添加边,并将构成的环上的最长边移除反证。按照这个思路,依次考虑 S − T S-T S−T 条边,设其为 e = ( u , v ) e=(u,v) e=(u,v),若树上 u u u 到 v v v 的路径中权值最大的边(以 D F S DFS DFS 求解),其权值大于 e e e 的权值,那么可以用 e e e 替换以获得边权和更小的生成树。
#include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int inf = 0x3f3f3f3f, maxv = 25, maxe = maxv * maxv;
struct edge
{
int from, to, cost;
bool operator<(const edge &b) const
{
return cost < b.cost;
}
} me[maxv], es[maxe];
int E, V, S, res, G[maxv][maxv], F[maxv][maxv], wc[maxv], vc[maxv], par[maxv];
bool used[maxv];
map<string, int> id;
int find(int x)
{
return par[x] == x ? x : (par[x] = find(par[x]));
}
void Kruskal()
{
int e = 0;
for (int i = 2; i <= V; ++i)
for (int j = i + 1; j <= V; ++j)
if (G[i][j] != inf)
es[e++] = edge{i, j, G[i][j]};
sort(es, es + e);
for (int i = 1; i <= V; ++i)
par[i] = i;
for (int i = 0; i < e; ++i)
{
int u = es[i].from, v = es[i].to;
int x = find(u), y = find(v);
if (x != y)
{
par[x] = y;
F[u][v] = F[v][u] = 1, res += es[i].cost;
}
}
}
void dfs(int v, edge e)
{
me[v] = e, used[v] = 1;
for (int i = 2; i <= V; ++i)
{
if (!used[i] && F[v][i])
{
if (G[v][i] > e.cost)
e.cost = G[v][i], e.from = v, e.to = i;
dfs(i, e);
e = me[v];
}
}
}
int main()
{
cin >> E;
id["Park"] = ++V;
memset(G, 0x3f, sizeof(G));
for (int i = 0; i < E; ++i)
{
string a, b;
int w;
cin >> a >> b >> w;
int u = id[a] ? id[a] : (id[a] = ++V);
int v = id[b] ? id[b] : (id[b] = ++V);
G[u][v] = G[v][u] = min(G[u][v], w);
}
Kruskal();
cin >> S;
memset(wc, 0x3f, sizeof(wc));
for (int i = 2; i <= V; ++i)
{
int rt = find(i);
if (wc[rt] > G[1][i])
wc[rt] = G[1][vc[rt] = i];
}
for (int i = 2; i <= V; ++i)
if (wc[i] != inf)
{
--S, F[1][vc[i]] = F[vc[i]][1] = 1;
res += wc[i];
}
while (S--)
{
memset(used, 0, sizeof(used));
dfs(1, edge{0, 0, 0});
int w = 0, j;
for (int i = 2; i <= V; ++i)
if (G[1][i] != inf && !F[1][i] && w < me[i].cost - G[1][i])
w = me[i].cost - G[1][j = i];
if (w == 0)
break;
int u = me[j].from, v = me[j].to;
F[u][v] = F[v][u] = 0;
F[1][j] = F[j][1] = 1;
res -= w;
}
cout << "Total miles driven: " << res << endl;
return 0;
}