一、题目链接
二、题目分析
(一)算法标签
最短路 spfa
(二)解题思路
注意st数组的含义:表示当前点在不在队列,入队前标记为true,出队后标记为false
三、AC代码
解法一:
#include <iostream>
#include <cstring>
#include <algorithm>
#include <climits>
#include <queue>
using namespace std;
const int N = 1e4 + 10, M = 5e5 + 10;
int h[N], w[M], e[M], ne[M], idx;
void add(int a, int b, int c)
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++ ;
}
int n, m, s;
int a, b, c;
bool st[N];
int dist[N];
void spfa()
{
memset(dist, 0x3f, sizeof dist);
dist[s] = 0;
queue<int> q;
q.push(s);
st[s] = true;
while (!q.empty())
{
auto t = q.front();
q.pop();
st[t] = false;
for (int i = h[t]; ~i; i = ne[i])
{
int j = e[i];
if (dist[j] > dist[t] + w[i])
{
dist[j] = dist[t] + w[i];
if (!st[j])
{
st[j] = true;
q.push(j);
}
}
}
}
}
int main()
{
memset(h, -1, sizeof h);
cin >> n >> m >> s;
for (int i = 0; i < m; i ++ )
{
scanf("%d%d%d", &a, &b, &c);
add(a, b, c);
}
spfa();
for (int i = 1; i <= n; i ++ )
if (dist[i] == 0x3f3f3f3f) cout << INT_MAX << ' ';
else cout << dist[i] << ' ';
return 0;
}