oj.uz

Submission #757347

# Submission time Handle Problem Language Result Execution time Memory
757347 2023-06-13T05:42:26 Z SanguineChameleon Pyramid Base (IOI08_pyramid_base) C++17
80 / 100
 5000 ms 45588 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;
}

const int maxN = 1e6 + 20;
const int maxK = 4e5 + 20;
int tree[maxN << 2];
int lazy[maxN << 2];
int Lx[maxK];
int Ly[maxK];
int Rx[maxK];
int Ry[maxK];
int ly[maxK];
int ry[maxK];
int cost[maxK];
int queries[maxK << 2];
pair<int, int> events_x[maxK << 1];
pair<int, int> events_y[maxK << 1];
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;
	events_x[0].first = 1;
	events_x[0].second = 0;
	events_x[1].first = n + 1;
	events_x[1].second = 0;
	events_y[0].first = 1;
	events_y[0].second = 0;
	events_y[1].first = m + 1;
	events_y[1].second = 0;
	int sz_x = 2;
	int sz_y = 2;
	for (int i = 1; i <= K; i++) {
		int lx = max(1, Lx[i] - sz + 1);
		int rx = min(n, Rx[i]);
		ly[i] = max(1, Ly[i] - sz + 1);
		ry[i] = min(m, Ry[i]);
		if (lx <= rx && ly[i] <= ry[i]) {
			events_x[sz_x].first = lx;
			events_x[sz_x].second = i;
			events_x[sz_x + 1].first = rx + 1;
			events_x[sz_x + 1].second = -i;
			sz_x += 2;
			events_y[sz_y].first = ly[i];
			events_y[sz_y].second = i;
			events_y[sz_y + 1].first = ry[i] + 1;
			events_y[sz_y + 1].second = -i;
			sz_y += 2;
		}
	}
	sort(events_x, events_x + sz_x);
	sort(events_y, events_y + sz_y);
	n = 0;
	int sz_q = 0;
	for (int i = 0; i < sz_x; i++) {
		if (i == 0 || events_x[i].first != events_x[i - 1].first) {
			if (n) {
				queries[sz_q++] = 0;
			}
			n++;
		}
		int id = events_x[i].second;
		if (id) {
			queries[sz_q++] = id;
		}
	}
	n--;
	m = 0;
	for (int i = 0; i < sz_y; i++) {
		if (i == 0 || events_y[i].first != events_y[i - 1].first) {
			m++;
		}
		int id = events_y[i].second;
		if (id > 0) {
			ly[id] = m;
		}
		else {
			ry[-id] = m - 1;
		}
	}
	m--;
	reset(1, 1, m);
	for (int i = 0; i < sz_q; i++) {
		int id = queries[i];
		if (id > 0) {
			update(1, 1, m, ly[id], ry[id], cost[id]);
		}
		else if (id < 0) {
			update(1, 1, m, ly[-id], ry[-id], -cost[-id]);
		}
		else if (tree[1] <= B) {
			return true;
		}
	}
	return false;
}

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

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 468 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 468 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 488 KB Output is correct
2 Correct 11 ms 512 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 516 KB Output is correct
2 Correct 10 ms 496 KB Output is correct

Subtask #8
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 816 KB Output is correct
2 Correct 83 ms 872 KB Output is correct
3 Correct 43 ms 852 KB Output is correct

Subtask #9
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 1976 KB Output is correct
2 Correct 331 ms 1996 KB Output is correct
3 Correct 198 ms 1940 KB Output is correct

Subtask #10
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 2312 KB Output is correct
2 Correct 48 ms 1844 KB Output is correct
3 Correct 125 ms 2752 KB Output is correct
4 Correct 239 ms 2764 KB Output is correct

Subtask #11
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 3232 KB Output is correct
2 Correct 406 ms 3216 KB Output is correct
3 Correct 132 ms 2260 KB Output is correct

Subtask #12
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 270 ms 3028 KB Output is correct
2 Correct 513 ms 3616 KB Output is correct
3 Correct 505 ms 3616 KB Output is correct
4 Correct 530 ms 3712 KB Output is correct
5 Correct 534 ms 3736 KB Output is correct
6 Correct 131 ms 2704 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4100 ms 23292 KB Output is correct
2 Correct 1300 ms 15420 KB Output is correct

Subtask #14
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5044 ms 30384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #15
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5027 ms 45588 KB Time limit exceeded
2 Halted 0 ms 0 KB -