求助最短路，悬关

#include <bits/stdc++.h>
#define fr first
#define sc second
#define N 100010
#define mod 998244353
#define inf 2147483647
#define ll long long
#define mp make_pair
using namespace std;
ll n, m, s;
ll dis[N];
vector <pair <ll, ll> > G[N];
struct edge {
	ll u; ll w;
	bool operator<(edge a) const{
		return a.w < w;
	}
} ;
priority_queue <edge> q;
bool vis[N];
void Dijkstra() {
	for (int i = 1; i <= n; i++) dis[i] = inf;
	dis[s] = 0;
	q.push(edge{s, 0});
	while (!q.empty()) {
		ll u = q.top().u; q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		for (auto nxt : G[u]) {
			if (dis[nxt.fr] > (ll)dis[u] + nxt.sc) {
				dis[nxt.fr] = (ll)dis[u] + nxt.sc;
				if (!vis[nxt.fr]) q.push(edge{nxt.fr, dis[nxt.fr]});
			}
		}
	}
}
int main(void) {
	cin >> n >> m >> s;
	for (int i = 1, u, v; i <= m; i++) {
		ll w;
		cin >> u >> v >> w;
		G[u].push_back(mp(v, w));
		G[v].push_back(mp(u, w));
	}
	Dijkstra();
	for (int i = 1; i <= n; i++) {
		cout << dis[i] << " ";
	}
	cout << '\n';
	return 0;
}