#include<map>
#include<queue>
#include<stack>
#include<cmath>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 100000 + 5;
const int maxv = 1000000 + 5;
struct Edge{
int to;
int dis;
Edge(int to,int dis){
this -> to = to;
this -> dis = dis;
}
friend bool operator<(Edge a,Edge b){
return a.dis>b.dis;
}
};
int N,M,a,b,c;
vector<Edge>graph[maxn];
priority_queue<Edge>q;
bool vis[maxn];
void init(){
while(!q.empty()) q.pop();
for(int i=0;i<maxn;i++) graph[i].clear();
memset(vis,false,sizeof(vis));
}
void input(){
scanf("%d%d",&N,&M);
for(int i=0;i<M;i++){
scanf("%d%d%d",&a,&b,&c);
graph[a].push_back(Edge(b,c));
graph[b].push_back(Edge(a,c));
}
}
int queue_prim(){
for(int i=0;i<graph[1].size();i++){
q.push(graph[1][i]);
}
vis[1]=true;
int left=N-1;
int sum=0;
while(!q.empty()&&left){
Edge e=q.top(); q.pop();
if(vis[e.to]) continue;
sum+=e.dis;
left--;
vis[e.to]=true;
for(int i=0;i<graph[e.to].size();i++){
Edge t=graph[e.to][i];
if(!vis[t.to]) q.push(t);
}
}return sum;
}
void solve(){
printf("%d\n",queue_prim());
}
int main(){
init();
input();
solve();
return 0;
}
hihocoder-1109-堆优化的prim
最新推荐文章于 2019-02-10 14:55:00 发布