Submission #1225978

---

Source Code Expand

#include<iostream>
#include<vector>
#include<queue>
#include<functional>
using namespace std;
int n, l, t, a[100000], s[100000], g[100000];
int main() {
	priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>Q;
	cin >> n >> l >> t; l *= 2; t *= 2;
	for (int i = 0; i < n; i++) { cin >> a[i] >> s[i]; a[i] *= 2; if (s[i] == 1)s[i] = 1; else s[i] = -1; }
	for (int i = 0; i < n; i++) {
		if (s[i] == 1 && s[(i + 1) % n] == -1) { Q.push(make_pair(((a[(i + 1) % n] - a[i] + l) % l) / 2, i)); }
	}
	int D = t % (2 * l);
	while (!Q.empty()) {
		int a1 = Q.top().first, a2 = Q.top().second; Q.pop();
		a[(a2 + 0 + n) % n] += (a1 - g[(a2 + 0 + n) % n])*s[(a2 + 0 + n) % n];
		a[(a2 + 0 + n) % n] = (a[(a2 + 0 + n) % n] + l) % l;
		a[(a2 + 1 + n) % n] += (a1 - g[(a2 + 1 + n) % n])*s[(a2 + 1 + n) % n];
		a[(a2 + 1 + n) % n] = (a[(a2 + 1 + n) % n] + l) % l;
		s[a2] = -1; s[(a2 + 1) % n] = 1;
		g[a2] = a1; g[(a2 + 1) % n] = a1;
		if (n >= 3) {
			a[(a2 - 1 + n) % n] += (a1 - g[(a2 - 1 + n) % n])*s[(a2 - 1 + n) % n];
			a[(a2 - 1 + n) % n] = (a[(a2 - 1 + n) % n] + l) % l;
			g[(a2 - 1 + n) % n] = a1;
			if (s[(a2 - 1 + n) % n] == 1 && s[a2] == -1) {
				int F = a1 + ((a[a2] - a[(a2 - 1 + n) % n] + l) % l) / 2;
				if (F <= D) { Q.push(make_pair(F, (a2 - 1 + n) % n)); }
			}
		}
		if (n >= 4) {
			a[(a2 + 2 + n) % n] += (a1 - g[(a2 + 2 + n) % n])*s[(a2 + 2 + n) % n];
			a[(a2 + 2 + n) % n] = (a[(a2 + 2 + n) % n] + l) % l;
			g[(a2 + 2 + n) % n] = a1;
			if (s[(a2 + 2 + n) % n] == -1 && s[(a2 + 1 + n) % n] == 1) {
				int F = a1 + ((a[(a2 + 2 + n) % n] - a[(a2 + 1 + n) % n] + l) % l) / 2;
				if (F <= D) { Q.push(make_pair(F, (a2 + 1) % n)); }
			}
		}
	}
	for (int i = 0; i < n; i++) {
		a[i] += (D - g[i])*s[i];
		a[i] = (a[i] + l) % l;
	}
	for (int i = 0; i < n; i++)cout << a[i] / 2 << endl;
	return 0;
}

Submission Info

Judge Result