Acwing笔记 堆优化Dijkstra

 样例输入

3 3

1 2 2

2 3 1

1 3 4

样例输出

3

#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <vector>
using namespace std;

typedef pair<int, int> PII;	//距离，编号

const int N = 1e5 + 10;
int n, m;
int h[N], e[N], ne[N], w[N], idx;
int dist[N];
bool st[N];

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())	//队列不为空
	{
		auto 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] > distance + w[i])
			{
				dist[j] = distance + w[i];
				heap.push({ dist[j],j });	//更新成功将这个点放入队列里面去
			}
		}
	}

	if (dist[n] == 0x3f3f3f3f)return -1;
	return dist[n];
}

int main()
{
	scanf("%d%d", &n, &m);

	memset(h, -1, sizeof h);

	while (m--)
	{
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		add(a, b, c);
	}

	int t = dijkstra();

	printf("%d\n", t);

	return 0;
}