AcWing 850. Dijkstra求最短路 II（堆优化）

#include<algorithm>
#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
const int N=1e5+10;
int e[N],ne[N],w[N],h[N],idx;
int dist[N];
bool st[N];
int n,m;
typedef pair<int,int> PII;
void add(int a,int b,int c)
{
    e[idx]=b;
    w[idx]=c;
    ne[idx]=h[a];
    h[a]=idx++;
}
int dijkstra()
{
    memset(dist,0x3f,sizeof dist);
    dist[1]=0;
    priority_queue<PII,vector<PII>,greater<PII>> heap;//小根堆
    heap.push({0,1});//距离为0，编号为1
    while(heap.size())
    {
        auto t=heap.top();
        heap.pop();
        int var=t.second,distance1=t.first;
        if(st[var]) continue;
        for(int i=h[var];i!=-1;i=ne[i])//通过t来扩展点
        {
            int j=e[i];
            if(dist[j]>distance1+w[i])//松弛操作
            {
                dist[j]=distance1+w[i];
                heap.push({dist[j],j});//将被松弛的加入队列
            }
        }
    }
    if(dist[n]==0x3f3f3f3f) return -1;
    return dist[n];
}
int main()
{
    cin>>n>>m;
    memset(h,-1,sizeof(h));
    while(m--)
    {
        int a,b,c;
        cin>>a>>b>>c;
        add(a,b,c);
    }
    int t=dijkstra();
    cout<<t<<endl;
    return 0;
}