模板题,原计划觉得kruskal稳如狗根本不用管,但是保险起见还是敲一遍,如果忘了就吃键盘。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e5+4,M=1e6+4;
int n,m,fa[N];
struct EDGE {
int u,v,w;
friend bool operator <(const EDGE &a,const EDGE &b) {
return a.w<b.w;
}
}d[M];
inline int find(int x) {
return fa[x]==x?x:fa[x]=find(fa[x]);
}
inline void kruskal(EDGE *e,int m) {
sort(e+1,e+m+1);
for (register int i=1;i<=n;++i) fa[i]=i;
int sum=0,blo=n;
for (register int i=1;i<=m;++i) {
int u=find(e[i].u),v=find(e[i].v),w=e[i].w;
if (u^v) --blo,fa[u]=v,sum+=e[i].w;
}
printf("%d\n",sum);
}
inline int read() {
int x=0;char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=(x<<3)+(x<<1)+c-'0',c=getchar();
return x;
}
int main() {
n=read(),m=read();
for (register int i=1;i<=m;++i) d[i].u=read(),d[i].v=read(),d[i].w=read();
kruskal(d,m);
return 0;
}