一、题目链接
二、题目分析
(一)算法标签
最小生成树 Prim
(二)解题思路
三、AC代码
解法一:
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 510, INF = 0x3f3f3f3f;
int g[N][N];
int n, m;
int a, b, c;
bool st[N];
int dist[N];
// 先初始化距离dist,
// 然后n次迭代,
// 1每次找到集合外距离最近的点t,
// 2判断i,和提前返回,或加上结果
// 3st[t]=true,
// 4用该点更新其它点到集合的距离
int prim()
{
memset(dist, 0x3f, sizeof dist);
int res = 0;
for (int i = 0; i < n; i ++ )
{
int t = -1;
for (int j = 1; j <= n; j ++ )
if (!st[j] && (t == -1 || dist[j] < dist[t]))
t = j;
if (i && dist[t] == INF) return INF;
if (i) res += dist[t];
st[t] = true;
for (int j = 1; j <= n; j ++ )
dist[j] = min(dist[j], g[t][j]);
}
return res;
}
int main()
{
memset(g, 0x3f, sizeof g);
cin >> n >> m;
for (int i = 0; i < m; i ++ )
{
scanf("%d%d%d", &a, &b, &c);
g[a][b] = g[b][a] = min(g[a][b], c); // 无向图+处理重边
}
int t = prim();
if (t == INF) puts("impossible");
else cout << t << endl;
return 0;
}