例题一: 单源最短路径 link
思路:
模板,没有什么好讲的。
提醒一下,dij比spfa更加稳定。
Floyed: O ( n 3 ) O(n^3) O(n3) = 1 0 15 10^{15} 1015 TLE
SPFA: O ( n m ) O(nm) O(nm)= 2 ∗ 1 0 10 2*10^{10} 2∗1010 TLE
dijkstra: O ( n log ( n + m ) ) O(n \log (n+m)) O(nlog(n+m))
#include<queue>
#include<cstdio>
#include<cstring>
using namespace std;
struct node {
int x, to, nxt;
}e[200001];
int n, m, s, x, y, z, le[100001], KK;
long long dis[100001];
bool in[100001];
priority_queue <pair<long long, int>, vector<pair<long long, int> >, greater<pair<long long, int> > > q;
void add(int x, int y, int z) {
e[++KK] = (node){
z, y, le[x]}; le[x] = KK;
}
void dij() {
//dij加堆优化
memset(dis, 0x7f, sizeof(dis));
dis[s] = 0;
q.push(make_pair(0, s));
while (!q.empty()) {
int now = q.top().second;
long long now_d = q.top().first;
q.pop();
if (in[now]) continue;
in[now] = 1;
for (int i = le[now]; i; i = e[i].nxt)
if (!in[e[i].to] && now_d + 1ll * e[i].x < dis[e[i].to]) {
dis[e[i].to] = now_d + 1ll * e[i].x;
q.push(make_pair(dis[e[i].to], e[i].to));
}
}
}
int main() {
scanf("%d %d %d", &n, &m, &s);
for (int i = 1; i <= m; i++) {
scanf("%d %d %d", &x, &y, &z);
add(x, y, z);
}
dij();
for (int i = 1; i <= n; i++)
printf("%lld ", dis[i]);
return 0