最短路径dijkstra（链式前向星 + 堆优化线段树优化）

模板链接

某谷

堆优化

#include <iostream>
#include <string.h>
#include <vector>
#include <queue>
//#include <pair>
using namespace std;

int n, m, s;
const int N = 4e5 + 10;
const int INF = 0x3f3f3f3f;
int e[N], ne[N], w[N], idx, h[N];
int dist[N], st[N];
inline void add(int a, int b, int c) {
	e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}


void dijkstra(int s) {
	priority_queue < pair<int, int>, vector<pair<int, int> >, greater<pair<int, int>> >  q;
	q.push({ 0, s });
	dist[s] = 0;

	while (q.size()) {
		auto p = q.top();
		q.pop();
		int d = p.first;
		int x = p.second;
		if (st[x]) continue;
		st[x] = 1;
		for (int i = h[x]; ~i; i = ne[i]) {
			int j = e[i], c = w[i];
			if (d + c < dist[j]) {
				dist[j] = d + c;
				q.push({ d + c, j });
			}
		}
	}
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
#endif // !ONLINE_JUEGE
	memset(h, -1, sizeof h);
	memset(dist, 0x3f, sizeof dist);
	scanf("%d%d%d", &n, &m, &s);
	while (m--) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		add(a, b, c);
	}
	dijkstra(s);
	for (int i = 1; i <= n; i++) printf("%d ", dist[i]);
	return 0;
}

线段树优化

#include <iostream>
#include <string.h>
#include <vector>
#include <queue>
//#include <pair>
using namespace std;

int n, m, s;
const int N = 4e5 + 10;
const int INF = 0x3f3f3f3f;
int e[N], ne[N], w[N], idx, h[N];
int dist[N], st[N];

struct node {
	int l, r;
	int val;
	int p;
}tr[N];
void pushup(int u) {
	if (tr[u << 1].val < tr[u << 1 | 1].val) {
		tr[u].val = tr[u << 1].val;
		tr[u].p = tr[u << 1].p;
	}
	else {
		tr[u].val = tr[u << 1 | 1].val;
		tr[u].p = tr[u << 1 | 1].p;
	}
}
void build(int u, int l, int r) {
	tr[u] = { l, r };
	if (l >= r) {
		tr[u].val = INF;
		tr[u].p = l;
		return;
	}
	int mid = l + r >> 1;
	build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
	pushup(u);
}



pair<int,int> query(int u) {
	return { tr[u].val, tr[u].p };
}

void modify(int u, int k, int x) {
	if (tr[u].l == k && tr[u].r == k) {
		tr[u].val = x;
		return;
	}
	int mid = tr[u].l + tr[u].r >> 1;
	if (k <= mid) modify(u << 1, k, x);
	else modify(u << 1 | 1, k, x);
	pushup(u);
}

inline void add(int a, int b, int c) {
	e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx++;
}


void dijkstra(int s) {
	modify(1, s, 0);
	dist[s] = 0;
	while (1) {
		pair<int, int> p = query(1);
		int d = p.first;
		int x = p.second;
		if (d == INF) break;
		//if (st[x]) continue;
		//st[x] = 1;
		modify(1, x, INF);
		for (int i = h[x]; ~i; i = ne[i]) {
			int j = e[i], c = w[i];
			if (dist[j] > d + c) {
				dist[j] = d + c;
				modify(1, j, d + c);
			}
		}
	}
}

int main() {
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
#endif // !ONLINE_JUEGE
	memset(h, -1, sizeof h);
	memset(dist, 0x3f, sizeof dist);
	scanf("%d%d%d", &n, &m, &s);
	build(1, 1, n);
	while (m--) {
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		add(a, b, c);
	}
	dijkstra(s);
	for (int i = 1; i <= n; i++) printf("%d ", dist[i]);
	return 0;
}

Tips

主要都是维护了几个数的最大值，在洛谷上跑了一下普通最大堆(priority_queue + queue) 970ms，普通线段树(手写) 570ms，可见线段树要优秀一些常数。