以LUOGU 3371作为测试模板
Dijkstra 矩阵存图 70分
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int MAXN = 1000 + 10;
int N, M, S;
int cost[MAXN][MAXN];
int d[MAXN];
bool vis[MAXN];
void dijkstra(int s) {
memset(d, 0x3f3f3f3f, sizeof(d));
memset(vis, false, sizeof(vis));
d[s] = 0;
while(true) {
int v = -1;
for(int u = 1; u <= N; ++u) {
if(!vis[u] && (v == -1 || d[u] < d[v])) v = u;
}
if(v == -1) break;
vis[v] = true;
for(int u = 1; u <= N; ++u) {
d[u] = min(d[u], d[v] + cost[v][u]);
}
}
}
int main() {
scanf("%d%d%d", &N, &M, &S);
memset(cost, 0x3f3f3f3f, sizeof(cost));
for(int i = 1, u, v, w; i <= M; ++i) {
scanf("%d%d%d", &u, &v, &w);
if(w > cost[u][v]) continue;
cost[u][v] = w;
}
dijkstra(S);
for(int i = 1; i <= N; ++i) {
if(d[i] == 0x3f3f3f3f) printf("2147483647 ");
else printf("%d ", d[i]);
}
return 0;
}
SPFA 链式前向星 AC
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int MAXN = 50000 + 10;
const int MAXM = 500000 + 10;
struct data { int to, next, w; }edge[MAXM];
int head[MAXN], dis[MAXN], cnt, n, m, s;
bool vis[MAXN];
inline void addedge(int u, int v, int w) {
edge[++cnt].to = v; edge[cnt].next = head[u];
edge[cnt].w = w; head[u] = cnt;
}
void SPFA() {
memset(dis, 0x3f3f3f3f, sizeof(dis));
queue<int> Q; Q.push(s);
dis[s] = 0; vis[s] = true;
while(!Q.empty()) {
int now = Q.front(); Q.pop();
vis[now] = false;
for(int i = head[now]; i; i = edge[i].next) {
int son = edge[i].to, w = edge[i].w;
if(dis[son] > dis[now] + w) {
dis[son] = dis[now] + w;
if(!vis[son]) {
Q.push(son);
vis[son] = true;
}
}
}
}
}
int main() {
scanf("%d%d%d", &n, &m, &s);
for(int i = 1, u, v, w; i <= m; ++i) {
scanf("%d%d%d", &u, &v, &w);
addedge(u, v, w);
}
SPFA();
for(int i = 1; i <= n; ++i) {
if(dis[i] == 0x3f3f3f3f) printf("2147483647 ");
else printf("%d ", dis[i]);
}
return 0;
}
Dijkstra 堆优化 AC
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
const int MAXN = 10000 + 10;
const int MAXM = 500000 + 10;
inline int read() {
int x = 0, f = 1; char ch = getchar();
while(ch < '0' || ch > '9') { if(ch == '-') f = -1; ch = getchar(); }
while(ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
return x * f;
}
struct edge { int to, cost; };
typedef pair<int, int> P;
int N, M, S, dis[MAXN];
vector<edge> G[MAXN];
void dijkstra(int S) {
priority_queue<P, vector<P>, greater<P> > que;
memset(dis, 0x3f3f3f3f, sizeof(dis));
dis[S] = 0; que.push(P(0, S));
while(!que.empty()) {
P p = que.top(); que.pop();
int v = p.second;
if(dis[v] < p.first) continue;
for(int i = 0; i < G[v].size(); ++i) {
edge e = G[v][i];
if(dis[e.to] > dis[v] + e.cost) {
dis[e.to] = dis[v] + e.cost;
que.push(P(dis[e.to], e.to));
}
}
}
}
int main() {
N = read(), M = read(), S = read();
for(int i = 1, u, v, w; i <= M; ++i) {
u = read(), v = read(), w = read();
G[u].push_back((edge){v,w});
}
dijkstra(S);
for(int i = 1; i <= N; ++i) {
if(dis[i] == 0x3f3f3f3f) printf("2147483647 ");
else printf("%d ", dis[i]);
}
return 0;
}