拆地毯
//prim
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
struct node {
int x,y,z;
}edge[maxn];
bool cmp(node a,node b) {
return a.z > b.z;
}
int fa[maxn];
int n,m,u;
long long sum;
int get(int x) {
return x == fa[x] ? x : fa[x] = get(fa[x]);
}
int main(void) {
cin >> n >> m >> u;
for(int i = 1; i <= m; i ++) {
cin >> edge[i].x >> edge[i].y >> edge[i].z;
}
for(int i = 0; i <= n; i ++) {
fa[i] = i;
}
sort(edge + 1,edge + 1 + m,cmp);
// 每次加入一条最短的边
int p = 0;
for(int i = 1; i <= m; i ++) {
int x = get(edge[i].x);
int y = get(edge[i].y);
if(x == y) continue;
fa[y] = x;
sum += edge[i].z;
p ++;
if(p == u){
break;
}
}
// int ans = 0;
// for(int i = 1; i <= n; i ++) {
// if(i == fa[i]) ans ++;
// }
// if(ans > 1) puts("impossible");
// else printf("%lld\n",sum);
cout << sum;
return 0;
}
用prim算法
引入一个新的变量 u 代表所需要的边
每一次引入一条最短边 如果ok 记录一次 直到记录u次 结束
口袋的天空
//prim
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
struct node {
int x,y,z;
}edge[maxn];
bool cmp(node a,node b) {
return a.z < b.z;
}
int fa[maxn];
int n,m,u;
long long sum;
int get(int x) {
return x == fa[x] ? x : fa[x] = get(fa[x]);
}
int main(void) {
cin >> n >> m >> u;
for(int i = 1; i <= m; i ++) {
cin >> edge[i].x >> edge[i].y >> edge[i].z;
}
for(int i = 0; i <= n; i ++) {
fa[i] = i;
}
sort(edge + 1,edge + 1 + m,cmp);
int p = 0;
for(int i = 1; i <= m; i ++) {
int x = get(edge[i].x);
int y = get(edge[i].y);
if(x == y) continue;
fa[y] = x;
sum += edge[i].z;
p ++;
if(p == n - u){
break;
}
}
if(p != n - u){
cout << "No Answer";
return 0;
}
cout << sum;
return 0;
}
prim算法
k棵树 就需要有 n-k条边
每一次引入一条最短边 记录一次 然后直到记录到n-k条边 结束