Submission #1734730

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define MAXN	100005
template <typename T> void read(T &x) {
	x = 0; int f = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
int a[MAXN], b[MAXN], c[MAXN];
int X, n, q, r[MAXN];
int main() {
	read(X), read(n);
	b[0] = X;
	for (int i = 1; i <= n; i++) {
		read(r[i]);
		if (i % 2 == 1) {
			int delta = r[i] - r[i - 1];
			if (c[i - 1] >= delta) {
				a[i] = a[i - 1];
				b[i] = b[i - 1];
				c[i] = c[i - 1] - delta;
				continue;
			}
			int tmp = c[i - 1] + b[i - 1] - a[i - 1];
			if (tmp <= delta) {
				a[i] = b[i] = X;
				c[i] = 0;
				continue;
			}
			a[i] = a[i - 1] + delta - c[i - 1];
			b[i] = b[i - 1];
			c[i] = 0;
		} else {
			int delta = r[i] - r[i - 1];
			int tmp = c[i - 1] + b[i - 1] - a[i - 1];
			if (X - tmp >= delta) {
				a[i] = a[i - 1];
				b[i] = b[i - 1];
				c[i] = c[i - 1] + delta;
				continue;
			}
			if (X - c[i - 1] <= delta) {
				a[i] = b[i] = 0;
				c[i] = X;
				continue;
			}
			a[i] = a[i - 1];
			b[i] = b[i - 1] - (delta - (X - tmp));
			c[i] = X - (b[i] - a[i]);
		}
	}
	read(q);
	int pos = 0;
	for (int i = 1; i <= q; i++) {
		int t, x;
		read(t), read(x);
		while (pos < n && t >= r[pos + 1]) pos++;
		int tmp = c[pos], tnp = t - r[pos];
		if (x >= b[pos]) tmp = c[pos] + b[pos] - a[pos];
		else if (x >= a[pos]) tmp = c[pos] + x - a[pos];
		if (pos & 1) tmp = min(tmp + tnp, X);
		else tmp = max(tmp - tnp, 0);
		printf("%d\n", tmp);
	}
	return 0;
}

Submission Info

Judge Result