【Luogu3366】【模板】最小生成树

problem

solution

codes

#include<iostream>
#include<algorithm>
#define maxn 200020
using namespace std;
int n, m;
struct UndirectedEdge{
    int u, v, w;
    UndirectedEdge(){}
    UndirectedEdge(int u, int v, int w): u(u),v(v),w(w){}
    bool operator < (const UndirectedEdge & other)const{
        return w < other.w;
    }
}edges[maxn];
struct UnionFindSet{
    int fa[maxn];
    UnionFindSet(int n){
        for(int i = 1; i <= n; i++)fa[i] = i;
    }
    int find(int x){  return fa[x]==x ? x : fa[x]=find(fa[x]);  }
    void merge(int x, int y){
        int xx = find(x), yy = find(y);
        if(xx != yy)fa[xx] = yy;
    }
};
inline int kruskal(){
    int sum = 0,  count = 0;
    UnionFindSet ufs(n);
    std::sort(edges, edges+m);
    for(int i = 1; i <= m; i++){
        if(ufs.find(edges[i].u) != ufs.find(edges[i].v)){
            ufs.merge(edges[i].u,edges[i].v);
            sum += edges[i].w;
            count++;
            if(count == n-1) break;
        }
    }
    return sum;
}

int main(){
    cin>>n>>m;
    for(int i = 1; i <= m; i++)
        cin>>edges[i].u>>edges[i].v>>edges[i].w;
    cout<<kruskal()<<"\n";
}
  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/80628543