题目传送门
解题思路
因为数据量过大,无法使用普通的dijkstra算法以及邻接矩阵来存图,这里我们可以使用邻接表+堆优化的dijkstra算法,或者采用链式前向星+堆优化的dijkstra算法,这里给出后者的代码。
Code
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 5;
const int M = 2e5 + 5;
typedef pair<int, int> P;
struct Edge {
int next, to, w;
}edge[M];
int n, m, st, ed, cnt;
int head[N], dis[N];
bool vis[N];
inline void init()
{
cnt = 0;
memset(head, -1, sizeof head);
memset(dis, INF, sizeof dis);
memset(vis, false, sizeof vis);
}
inline void add(int u, int v, int w)
{
edge[cnt].w = w;
edge[cnt].to = v;
edge[cnt].next = head[u];
head[u] = cnt++;
}
void Dijkstra()
{
priority_queue<P, vector<P>, greater<P> > q;
dis[st] = 0;
q.push({0, st});
while(q.size()) {
P now = q.top(); q.pop();
int u = now.second;
if(vis[u]) continue;
vis[u] = true;
for(int i = head[u]; ~i; i = edge[i].next) {
int v = edge[i].to;
if(!vis[v] && dis[v] > dis[u] + edge[i].w) {
dis[v] = dis[u] + edge[i].w;
q.push({dis[v], v});
}
}
}
}
int main()
{
int a, b, c;
init();
cin >> n >> m >> st;
for(int i = 1; i <= m; ++i) {
cin >> a >> b >> c;
add(a, b, c);
}
Dijkstra();
for(int i = 1; i <= n; ++i) {
cout << dis[i] << " ";
}
cout << endl;
return 0;
}