oj.uz

Submission #547502

# Submission time Handle Problem Language Result Execution time Memory
547502 2022-04-10T21:23:10 Z sidon Pyramid Base (IOI08_pyramid_base) C++17
100 / 100
 1884 ms 176672 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int Z = 4e5+1, LIM = 1e6+1;
const ll INF = 1e18;

int sL, sR;
ll sV;
struct ST0 {
	int l, r;
	ll v {}, add {};
	ST0 *L, *R;
	ST0(int lv, int rv) : l(lv), r(rv) {
		if(r - l > 1) {
			int m = (l + r) / 2;
			L = new ST0(l, m);
			R = new ST0(m, r);
		}
	}
	void rangeAdd(int lv, int rv, ll val) {
		sL = lv, sR = rv + 1, sV = val;
		rangeAdd();
	}
	void rangeAdd() {
		if(sR <= l || r <= sL) return;
		if(sL <= l && r <= sR) {
			add += sV;
			v += sV;
			return;
		}
		L->rangeAdd();
		R->rangeAdd();
		v = min(L->v, R->v) + add;
	}
	void clear() {
		if(r - l > 1) L->clear(), R->clear();
		add = v = 0;
	}
};
struct ST1 {
	int l, r, add {};
	array<int, 3> v;
	ST1 *L, *R;
	ST1(int lv, int rv) : l(lv), r(rv) {
		v = {r - l, r - l, r - l};
		if(r - l > 1) {
			int m = (l + r) / 2;
			L = new ST1(l, m);
			R = new ST1(m, r);
		}
	}
	void pull() {
		if(add || r - l < 2) v = {!add, !add, !add};
		else {
			int m = (l + r) / 2;
			bool lf = L->v[0] == m - l, rf = R->v[0] == r - m;
			v = {max(L->v[2] + R->v[1], max(L->v[0], R->v[0])), L->v[1] + (lf ? R->v[1] : 0), R->v[2] + (rf ? L->v[2] : 0)};
		}
	}
	void rangeAdd(int lv, int rv, int val) {
		sL = lv, sR = rv + 1, sV = val;
		rangeAdd();
	}
	void rangeAdd() {
		if(sR <= l || r <= sL) return;
		if(sL <= l && r <= sR) return add += sV, pull();
		L->rangeAdd();
		R->rangeAdd();
		pull();
	}
};

int M, N, B, P;
vector<array<ll, 3>> a[2][LIM];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin >> N >> M >> B >> P;

	for(int i = 0; i < P; ++i) {
		array<ll, 5> u;
		for(ll &j : u) cin >> j;
		a[0][u[0]].push_back({u[1], u[3], u[4]});
		a[1][u[2]].push_back({u[1], u[3], u[4]});
	}

	int x = 0;
	if(B) {
		ST0* st = new ST0(1, M + 1);

		for(int y = 1<<20; y /= 2; ) if(x + y <= min(M, N)) {
			x ^= y;
			bool ok = 0;

			st->rangeAdd(M - x + 2, M, INF);

			for(int i = 1; i <= N && !ok; ++i) {
				for(const auto &[l, r, v] : a[0][i])
					st->rangeAdd(l - x + 1, r, v);
				if(i < x) continue;
				for(const auto &[l, r, v] : a[1][i-x])
					st->rangeAdd(l - x + 1, r, -v);
				ok = st->v <= B;
			}
			st->clear();
			if(!ok) x ^= y;
		}
	} else {
		ST1* st = new ST1(1, M + 1);

		for(int i = 1, j = 1; i <= N; ++i) {
			for(const auto &[l, r, v] : a[1][i-1])
				st->rangeAdd(l, r, -1);
			for(; j <= N && j - i < st->v[0]; ++j) {
				x = max(x, j - i);
				for(const auto &[l, r, v] : a[0][j])
					st->rangeAdd(l, r, 1);
			}
			x = max(x, min(j - i, st->v[0]));
		}
	}

	cout << x;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47288 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47148 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47368 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 48216 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 56620 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 141268 KB Output is correct
2 Correct 115 ms 141236 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 141140 KB Output is correct
2 Correct 107 ms 141188 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 48496 KB Output is correct
2 Correct 70 ms 48428 KB Output is correct
3 Correct 56 ms 48520 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 57604 KB Output is correct
2 Correct 390 ms 57604 KB Output is correct
3 Correct 309 ms 57560 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 782 ms 142460 KB Output is correct
2 Correct 42 ms 48468 KB Output is correct
3 Correct 221 ms 142388 KB Output is correct
4 Correct 914 ms 142544 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1228 ms 142764 KB Output is correct
2 Correct 1488 ms 142724 KB Output is correct
3 Correct 839 ms 142792 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1097 ms 143084 KB Output is correct
2 Correct 1844 ms 143096 KB Output is correct
3 Correct 1833 ms 143032 KB Output is correct
4 Correct 1884 ms 143128 KB Output is correct
5 Correct 1856 ms 143068 KB Output is correct
6 Correct 886 ms 143160 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 789 ms 153676 KB Output is correct
2 Correct 290 ms 74440 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 949 ms 160168 KB Output is correct
2 Correct 927 ms 166880 KB Output is correct
3 Correct 558 ms 164540 KB Output is correct

Subtask #15
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1178 ms 166452 KB Output is correct
2 Correct 1343 ms 176672 KB Output is correct
3 Correct 1365 ms 176500 KB Output is correct
4 Correct 1221 ms 175392 KB Output is correct
5 Correct 732 ms 175820 KB Output is correct