解题思路
- 由于要从1点到每个点仍保持最短路径,所以可以确定的是这题就是用最短路径做了,但要注意的是,从优先队列取出的应该不仅满足未走过且路径最短,而且要满足若路径相等,取出上一条边最短的点。在push点时不仅是小于,也要把相等的点压入。
#include <iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<queue>
using namespace std;
const int maxn=10000+10;
const int maxm=100000+10;
int n,m;
struct Edge{
int f,t,w;
Edge(int f,int t,int w):f(f),t(t),w(w){
}
};
vector<int> G[maxn];
vector<Edge> edges;
int vis[maxn];
int d[maxn];
struct Node{
int u,d,pre;
Node(int u=0,int d=0,int pre=0):u(u),d(d),pre(pre){}
bool operator<(const Node a)const{
if(d==a.d)
return pre>a.pre;
return d>a.d;
}
};
int solve(){
memset(vis,0,sizeof(vis));
for(int i=1;i<=n;i++) d[i]=1<<30;
d[1]=0;
priority_queue<Node> pq;
pq.push(Node(1,0,0));
int ans=0;
while(!pq.empty()){
Node node=pq.top();pq.pop();
int u=node.u;
if(vis[u]) continue;
vis[u]=1;
ans+=node.pre;
for(int i=0;i<G[u].size();i++){
Edge e=edges[G[u][i]];
int v=e.t;
if(d[v]>=d[u]+e.w){
d[v]=d[u]+e.w;
pq.push(Node(v,d[v],e.w));
}
}
}
return ans;
}
int main(){
scanf("%d %d",&n,&m);
for(int i=0;i<m;i++){
int u,v,w;
scanf("%d %d %d",&u,&v,&w);
edges.push_back(Edge(u,v,w));
edges.push_back(Edge(v,u,w));
int k=edges.size();
G[u].push_back(k-2);
G[v].push_back(k-1);
}
printf("%d",solve());
return 0;
}