口袋的天空 - 洛谷
kruskal求最小生成树模板问题。
将连通的代价从小到大排序,再用并查集判断两个点是否已经连通。
一开始有n个点,每当一个点加入树中,总数--,当点数于k相等时,输出最小生成树的权重。
AC代码:
#include<bits/stdc++.h>
using namespace std;
const int N = 1e4 + 5;
int n, m, k;
int p[N];
struct Edge{
int a, b, w;
bool operator< (const Edge &W)const{
return w < W.w;
}
}edges[N];
int find(int x){
if (x != p[x]) p[x] = find(p[x]);
return p[x];
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < m; i++){
int a, b , w;
cin >> a >> b >> w;
edges[i] = {a, b, w};
}
sort(edges, edges + m);
for (int i = 1; i <= n; i++) p[i] = i;
int res = 0, cnt = n;
for (int i = 0; i < m; i++){
int a = edges[i].a, b = edges[i].b, w = edges[i].w;
a = find(a), b = find(b);
if (a != b){
p[a] = b;
res += w;
cnt--;
}
if (cnt == k) {
cout << res;
return 0;
}
}
cout << "No Answer";
return 0;
}