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>
using namespace std;

const int N = 510;
int n, m;
int g[N][N];	//稠密图用邻接矩阵
int dist[N];
bool st[N];

int dijkstra()
{
	memset(dist, 0x3f, sizeof dist);
	dist[1] = 0;	//初始化

	for (int i = 0; i < n; i++)
	{
		int t = -1;
		for (int j = 1; j <= n; j++)	//不在st中，距离最近的点
			if (!st[j] && (t == -1 || dist[t] > dist[j]))
				t = j;

		st[t] = true;	//st <-- t

		for (int j = 1; j <= n; j++)	//用t来更新其他点的距离
			dist[j] = min(dist[j], dist[t] + g[t][j]);
	}

	if (dist[n] == 0x3f3f3f3f)return -1;	//不存在路线返回 -1
	return dist[n];
}

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

	memset(g, 0x3f, sizeof g);

	while (m--)
	{
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		g[a][b] = min(g[a][b], c);
	}

	int t = dijkstra();

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

	return 0;
}