原本想背一遍模板当练习，没想到只过了一个二号点

#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#include<string>
#include<set>
#include<map>
#include <vector>
using namespace std;

#define ll long long
#define ios ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define mm(a, b) memset(a, b, sizeof(a))
#define mp make_pair

typedef pair<int, int>pii;
const int inf = 0x3f3f3f3f;
const int N = 200010;

int n, m, s;
int e[N], ne[N], w[N], h[N], idx;
int dist[N];
bool st[N];
void add(int a, int b, int c) {
	e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}
void dij(int s) {
	mm(dist, inf);
	mm(st, false);
	dist[s] = 0;
	priority_queue<pii, vector<pii>, greater<pii> > q;
	q.push(mp(0, s));

	while (q.size()) {
		pii t = q.top();
		q.pop();

		int v = t.second, d = t.first;
		if (st[v])continue;
		st[v] = true;

		for (int i = h[v]; i != -1; i = ne[i]) {
			int j = e[i];
			if (dist[j] > dist[v] + w[i]) {
				dist[j] = dist[v] + w[i];
				q.push(mp(dist[j], j));
			}
		}
	}
}
int main() {
	ios;
	mm(h, -1);
	cin >> n >> m >> s;
	int a, b, c;
	for (int i = 1; i <= m; i++) {
		cin >> a >> b >> c;
		add(a, b, c), add(b, a, c);
	}
	dij(s);
	for (int i = 1; i < n; i++) cout << dist[i] << " ";
	cout << dist[n];
	return 0;
}