Codeforces 786D Legacy（线段树优化建图）

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b)	for (int i(a); i <= (b); ++i)
#define dec(i, a, b)	for (int i(a); i >= (b); --i)
#define	ls		(i << 1)
#define	rs		(i << 1 | 1)
#define	mid		((L + R) >> 1)
#define	lson		ls, L, mid
#define	rson		rs, mid + 1, R


typedef long long LL;
typedef pair <int, int> PII;

const int N = 2e6 + 10;

struct node{
	int u;
	LL w;
	friend bool operator < (const node &a, const node &b){
		return a.w > b.w;
	}
};

map <PII, int> mp;
int tot = 0;
int n, q, s, cnt;
LL dis[N];
vector <node> v[N];

void addedge(int x, int y, LL z){
	v[x].push_back({y, z});
}

void build(int i, int L, int R){
	cnt = max(cnt, i);
	if (L == R){
		addedge(i + n, L, 0);
		return;
	}

	build(lson);
	build(rson);
	addedge(i + n, ls + n, 0);
	addedge(i + n, rs + n, 0);	
}

void build2(int i, int L, int R){
	if (L == R){
		addedge(L, i + n + cnt, 0);
		return;
	}

	build2(lson);
	build2(rson);
	addedge(ls + n + cnt, i + n + cnt, 0);
	addedge(rs + n + cnt, i + n + cnt, 0);
}


void work1(int i, int L, int R, int l, int r, int u, LL val){
	if (l <= L && R <= r){
		addedge(u, i + n, val);
		return;
	}

	if (l <= mid) work1(lson, l, r, u, val);
	if (r >  mid) work1(rson, l, r, u, val);
}

void work2(int i, int L, int R, int l, int r, int u, LL val){
	if (l <= L && R <= r){
		addedge(i + n + cnt, u, val);
		return;
	}

	if (l <= mid) work2(lson, l, r, u, val);
	if (r >  mid) work2(rson, l, r, u, val);
}

void dij(int s, LL dis[], vector <node> v[]){
	priority_queue <node> q;
	static bool vis[N];
	rep(i, 1, 2e6) dis[i] = 1e18, vis[i] = false;
	q.push({s, 0});
	dis[s] = 0;
	while (!q.empty()){
		int u = q.top().u; q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		for (auto edge : v[u]) if (dis[u] + edge.w < dis[edge.u]){
			dis[edge.u] = dis[u] + edge.w;
			q.push({edge.u, dis[edge.u]});
		}
	}
}

int main(){

	scanf("%d%d%d", &n, &q, &s);
	tot = n;
	build(1, 1, n);
	build2(1, 1, n);

	while (q--){
		int op;
		scanf("%d", &op);
		if (op == 1){
			int x, y;
			LL z;
			scanf("%d%d%lld", &x, &y, &z);
			if (x == y) continue;
			addedge(x, y, z);
		}
		else if (op == 2){
			int u, l, r;
			LL z;
			scanf("%d%d%d%lld", &u, &l, &r, &z);
			work1(1, 1, n, l, r, u, z);
		}

		else{
			int u, l, r;
			LL z;
			scanf("%d%d%d%lld", &u, &l, &r, &z);
			work2(1, 1, n, l, r, u, z);
		}
	}

	dij(s, dis, v);
	rep(i, 1, n) printf("%lld\n", (dis[i] < 1e18 ? dis[i] : -1));
	return 0;
}