oj.uz

Submission #757468

# Submission time Handle Problem Language Result Execution time Memory
757468 2023-06-13T08:24:49 Z SanguineChameleon Pyramid Base (IOI08_pyramid_base) C++17
70 / 100
 2037 ms 149692 KB 
#include <bits/stdc++.h>
using namespace std;

void just_do_it();

int main() {
	#ifdef KAMIRULEZ
		freopen("kamirulez.inp", "r", stdin);
		freopen("kamirulez.out", "w", stdout);
	#endif
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	just_do_it();
	return 0;
}

namespace sub2 {
	const int maxN = 1e6 + 20;
	int tree[maxN << 2];
	int lazy[maxN << 2];
	int Lx[maxN];
	int Ly[maxN];
	int Rx[maxN];
	int Ry[maxN];
	int cost[maxN];
	vector<int> queries[maxN];
	int N, M, B, K;

	void reset(int id, int lt, int rt) {
		tree[id] = 0;
		lazy[id] = 0;
		if (lt == rt) {
			return;
		}
		int mt = (lt + rt) >> 1;
		reset(id << 1, lt, mt);
		reset(id << 1 | 1, mt + 1, rt);
	}

	void update(int id, int lt, int rt, int ql, int qr, int add) {
		if (lt == ql && rt == qr) {
			tree[id] += add;
			lazy[id] += add;
			return;
		}
		tree[id << 1] += lazy[id];
		lazy[id << 1] += lazy[id];
		tree[id << 1 | 1] += lazy[id];
		lazy[id << 1 | 1] += lazy[id];
		lazy[id] = 0;
		int mt = (lt + rt) >> 1;
		if (qr <= mt) {
			update(id << 1, lt, mt, ql, qr, add);
		}
		else if (ql >= mt + 1) {
			update(id << 1 | 1, mt + 1, rt, ql, qr, add);
		}
		else {
			update(id << 1, lt, mt, ql, mt, add);
			update(id << 1 | 1, mt + 1, rt, mt + 1, qr, add);
		}
		tree[id] = min(tree[id << 1], tree[id << 1 | 1]);
	}

	bool check(int sz) {
		int n = N - sz + 1;
		int m = M - sz + 1;
		for (int i = 1; i <= n; i++) {
			queries[i].clear();
		}
		for (int i = 1; i <= K; i++) {
			int lx = max(1, Lx[i] - sz + 1);
			int rx = min(n, Rx[i]);
			int ly = max(1, Ly[i] - sz + 1);
			int ry = min(m, Ry[i]);
			if (lx <= rx && ly <= ry) {
				queries[lx].push_back(i);
				if (rx < n) {
					queries[rx + 1].push_back(-i);
				}
			}
		}
		reset(1, 1, m);
		for (int i = 1; i <= n; i++) {
			for (auto id: queries[i]) {
				if (id > 0) {
					int lt = max(1, Ly[id] - sz + 1);
					int rt = min(m, Ry[id]);
					update(1, 1, m, lt, rt, cost[id]);
				}
				else {
					int lt = max(1, Ly[-id] - sz + 1);
					int rt = min(m, Ry[-id]);
					update(1, 1, m, lt, rt, -cost[-id]);
				}
			}
			if (tree[1] <= B) {
				return true;
			}
		}
		return false;
	}

	void solve() {
		for (int i = 1; i <= K; i++) {
			cin >> Lx[i] >> Ly[i] >> Rx[i] >> Ry[i] >> cost[i];
		}
		int res = 0;
		int lt = 1;
		int rt = min(N, M);
		while (lt <= rt) {
			int mt = (lt + rt) >> 1;
			if (check(mt)) {
				res = mt;
				lt = mt + 1;
			}
			else {
				rt = mt - 1;
			}
		}
		cout << res;
	}
}

namespace sub13 {
	struct node {
		int len, min_val, best_all, best_pref, best_suf, lazy;

		node() {};

		node(int _len): len(_len), min_val(0), best_all(_len), best_pref(_len), best_suf(_len), lazy(0) {};
	};

	const int maxN = 1e6 + 20;
	vector<pair<int, int>> rem[maxN];
	vector<pair<int, int>> add[maxN];
	node tree[maxN << 2];
	int N, M, B, K;

	node merge(node L, node R) {
		node res;
		res.len = L.len + R.len;
		res.min_val = min(L.min_val, R.min_val);
		res.best_all = 0;
		int sum = 0;
		if (L.min_val == res.min_val) {
			res.best_all = max(res.best_all, L.best_all);
			sum += L.best_suf;
			if (L.best_pref == L.len && R.min_val == res.min_val) {
				res.best_pref = L.len + R.best_pref;
			}
			else {
				res.best_pref = L.best_pref;
			}
		}
		else {
			res.best_pref = 0;
		}
		if (R.min_val == res.min_val) {
			res.best_all = max(res.best_all, R.best_all);
			sum += R.best_pref;
			if (R.best_suf == R.len && L.min_val == res.min_val) {
				res.best_suf = R.len + L.best_suf;
			}
			else {
				res.best_suf = R.best_suf;
			}
		}
		else {
			res.best_suf = 0;
		}
		res.best_all = max(res.best_all, sum);
		res.lazy = 0;
		return res;
	}

	void build(int id, int lt, int rt) {
		tree[id] = node(rt - lt + 1);
		if (lt == rt) {
			return;
		}
		int mt = (lt + rt) >> 1;
		build(id << 1, lt, mt);
		build(id << 1 | 1, mt + 1, rt);
	}

	void update(int id, int lt, int rt, int ql, int qr, int add) {
		if (lt == ql && rt == qr) {
			tree[id].lazy += add;
			tree[id].min_val += add;
			return;
		}
		tree[id << 1].lazy += tree[id].lazy;
		tree[id << 1].min_val += tree[id].lazy;
		tree[id << 1 | 1].lazy += tree[id].lazy;
		tree[id << 1 | 1].min_val += tree[id].lazy;
		tree[id].lazy = 0;
		int mt = (lt + rt) >> 1;
		if (qr <= mt) {
			update(id << 1, lt, mt, ql, qr, add);
		}
		else if (ql >= mt + 1) {
			update(id << 1 | 1, mt + 1, rt, ql, qr, add);
		}
		else {
			update(id << 1, lt, mt, ql, mt, add);
			update(id << 1 | 1, mt + 1, rt, mt + 1, qr, add);
		}
		tree[id] = merge(tree[id << 1], tree[id << 1 | 1]);
	}

	void solve() {
		for (int i = 1; i <= K; i++) {
			int lx, ly, rx, ry, cost;
			cin >> lx >> ly >> rx >> ry >> cost;
			add[lx].emplace_back(ly, ry);
			rem[rx].emplace_back(ly, ry);
		}
		build(1, 1, M);
		int rt = 0;
		int res = 0;
		for (int i = 1; i <= N; i++) {
			while (rt < N) {
				rt++;
				for (auto p: add[rt]) {
					update(1, 1, M, p.first, p.second, 1);
				}
				int best = (tree[1].min_val == 0 ? tree[1].best_all : 0);
				res = max(res, min(rt - i + 1, best));
				if (best < rt - i + 1) {
					for (auto p: add[rt]) {
						update(1, 1, M, p.first, p.second, -1);
					}
					if (rt > i) {
						rt--;
					}
					break;
				}
			}
			for (auto p: rem[i]) {
				update(1, 1, M, p.first, p.second, -1);
			}
		}
		cout << res;
	}
}

void just_do_it() {
	int N, M, B, K;
	cin >> N >> M >> B >> K;
	if (B > 0) {
		sub2::N = N;
		sub2::M = M;
		sub2::B = B;
		sub2::K = K;
		sub2::solve();
	}
	else {
		sub13::N = N;
		sub13::M = M;
		sub13::B = B;
		sub13::K = K;
		sub13::solve();
	}
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 70792 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 70740 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 70796 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 71512 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 76984 KB Output is correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 103 ms 120132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 423 ms 119988 KB Output is correct
2 Incorrect 102 ms 120016 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 71160 KB Output is correct
2 Correct 66 ms 71392 KB Output is correct
3 Correct 63 ms 71456 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 75212 KB Output is correct
2 Correct 350 ms 75648 KB Output is correct
3 Correct 235 ms 75832 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 244 ms 83868 KB Output is correct
2 Correct 97 ms 75596 KB Output is correct
3 Correct 209 ms 87756 KB Output is correct
4 Correct 540 ms 95948 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 94776 KB Output is correct
2 Correct 838 ms 97428 KB Output is correct
3 Correct 137 ms 81128 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 344 ms 84396 KB Output is correct
2 Correct 1106 ms 99960 KB Output is correct
3 Correct 1033 ms 99784 KB Output is correct
4 Correct 1122 ms 99756 KB Output is correct
5 Correct 1152 ms 100140 KB Output is correct
6 Correct 83 ms 80332 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1320 ms 131408 KB Output is correct
2 Correct 623 ms 86236 KB Output is correct

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1577 ms 136356 KB Output is correct
2 Incorrect 1164 ms 134432 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1754 ms 140836 KB Output is correct
2 Correct 1790 ms 143424 KB Output is correct
3 Incorrect 2037 ms 149692 KB Output isn't correct
4 Halted 0 ms 0 KB -