```cpp
#include<iostream>
#include<cstring>
#include<algorithm>
#include<stdio.h>
#include<queue>
#define MAXN 500088
#define INF 0x3f3f3f3f
using namespace std;
struct edge{
int u,dis,v;
}e[MAXN];
int dis[MAXN],h[MAXN],vis[MAXN],cnt,n,m,s;
inline void add_edge(int u,int v,int d)
{
cnt++;
e[cnt].dis=d;e[cnt].u=v;e[cnt].v=h[u];h[u] = cnt;
}
struct node{
int dis,pos;
bool operator < (const node x) const{
return x.dis<dis;
}
};
priority_queue<node> q;
void dijkstra()
{
s=1;
memset(dis,INF,sizeof(dis));
dis[s]=0;
q.push((node){0,s});
while(!q.empty()){
node tmp=q.top();
q.pop();
int x=tmp.pos,d=tmp.dis;
if(vis[x])
continue;
vis[x]=1;
for(int i=h[x];i;i=e[i].v){
int y=e[i].u;
if(dis[y]>dis[x]+e[i].dis){
dis[y]=dis[x]+e[i].dis;
if(!vis[y]){
q.push((node){dis[y],y});
}
}
}
}
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=m;i++){
int u,v,d;
scanf("%d%d%d",&u,&v,&d);
add_edge(u,v,d);add_edge(v,u,d);
}
dijkstra();cout<<dis[n];
return 0;
}
```
我的代码，啥是判重？？%%%大佬
by charliegong @ 2019-05-29 22:08:18