Dijkstra模板

#include<bits/stdc++.h>
using namespace std;

const int maxn = 100050;
const int INF = 0x3f3f3f3f3f3f3f3f;
int n, m;

struct Edge {
	int from, to, dist;
	Edge(int f, int t, int d) :from(f), to(t), dist(d) {}
};

vector<Edge>edges;
vector<int>G[maxn];

bool vis[maxn];
long long d[maxn];
int p[maxn];

void init(int N) {
	n = N;
	for (int i = 0;i < N;i++) {
		G[i].clear();
	}
	edges.clear();
}

void AddEdge(int from, int to, int dist) {
	edges.push_back(Edge(from, to, dist));
	int t = edges.size();
	G[from].push_back(t - 1);
}

struct Node {
	long long d;
	int u;
	bool operator < (const Node& rhs)const {
		return d > rhs.d;
	}
};

void dijkstra(int s) {
	priority_queue<Node>Q;
	for (int i = 1;i <= n;i++) {
		d[i] = INF;
	}
	d[s] = 0;

	memset(vis, 0, sizeof(vis));
	Q.push(Node{ 0,s });

	while (!Q.empty()) {
		Node x = Q.top();Q.pop();

		int u = x.u;

		if (vis[u]) {
			continue;
		}

		vis[u] = 1;

		for (int i = 0;i < G[u].size();i++) {
			Edge e = edges[G[u][i]];
			if (d[e.to] > d[u] + e.dist) {
				d[e.to] = d[u] + e.dist;
				p[e.to] = u;
				Q.push(Node{ d[e.to],e.to });
			}
		}
	}
}

int main() {
	int s;
	int a, b, x;
	while (cin >> n >> m >> s) {
		init(n);
		for (int i = 0;i < m;i++) {
			cin >> a >> b >> x;
			AddEdge(a, b, x);
		}
		dijkstra(s);

		for (int i = 1;i <= n;i++) {
			cout << d[i];
			printf("%s", i == n ? "\n" : " ");
		}
	}
}