850. Dijkstra求最短路 II(堆优化版的Dijkstra算法）

#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<queue>

using namespace std;

typedef pair<int,int> PII;//堆中存储的一个是这个点的距离，一个是这个点的编号。

const int N = 150010;

int dist[N];

int n, m;

bool st[N];

int h[N], e[N], w[N], ne[N],idx;

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});
    
    while(heap.size())
    {
        PII t = heap.top();
        heap.pop();
        
        int ver = t.second, distance = t.first;
        if(st[ver]) continue;
        st[ver] = true;
        
        for(int i = h[ver]; i != -1; i = ne[i])
        {
            int j = e[i];
            if(dist[j] > dist[ver] + w[i])
            {
            	dist[j] = dist[ver] + 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);
    }
    
    cout << dijkstra();
    
    return 0;
}//来自acwing