Submission #57113547

---

Source Code Expand

#include <bits/stdc++.h>
// Õë¶ÔÓÚÏßÉϱÈÈüµÄ C++ ÓïÑÔÄ£°å
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;

//#undef ONLINE_JUDGE // Èç¹ûÊǽ»»¥Òª¸Ä¶¯ÕâÀï
#define int long long

#ifndef ONLINE_JUDGE
#define endl '\n'
#define debug(x, ...) printf(x, __VA_ARGS__)
#else
#define debug(x, ...)
#endif

void clear() {
	// ÇëÔÚÕâÀïÍêÉƳõʼ»¯´úÂë
}

int n, m, x, a[200005], b[200005], s[200005], t[200005], lst[200005], ans[200005];

struct Info {
	int tme, typ, id;
	bool operator < (const Info &i) {
		if (tme != i.tme) return tme < i.tme;
		if (typ != i.typ) return typ < i.typ;
		return id < i.id;
	}
} tr[400005];

void solve() {
	cin >> n >> m >> x;
	for (int i = 1; i <= m; ++i) {
		cin >> a[i] >> b[i] >> s[i] >> t[i];
		tr[i * 2 - 1] = {s[i], 1, i};
		tr[i * 2] = {t[i], 0, i};
	}
	sort(tr + 1, tr + m + m + 1); ans[1] = x;
	for (int i = 1; i <= m + m; ++i) {
		if (tr[i].typ == 1) {
			if (tr[i].id != 1)
				ans[tr[i].id] = max(0ll, lst[a[tr[i].id]] - tr[i].tme);
		} else lst[b[tr[i].id]] = max(lst[b[tr[i].id]], tr[i].tme + ans[tr[i].id]);
	}
	for (int i = 2; i <= m; ++i) cout << ans[i] << " \n"[i == m];
	// ÇëÔÚÕâÀïÍêÉÆ´úÂë
}


signed main() {
	#ifdef ONLINE_JUDGE
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	#endif

	int tc = 1;
//	cin >> tc; // Èô²»ÆôÓöà²â£¬Çë×¢Ê͸ÃÄÚÈÝ
	while (tc--) {
		clear();
		solve();
	}
	return 0;
}

Submission Info

Judge Result