oj.uz

Submission #232335

# Submission time Handle Problem Language Result Execution time Memory
232335 2020-05-16T19:02:26 Z islingr Wall (IOI14_wall) C++14
0 / 100
 198 ms 43384 KB 
#include <iostream>
using namespace std;

const int inf = 1e9, N = 1 << 22;
int mx[N], mn[N];

void change(int v, int d, int u) {
	mn[v] = max(u, min(d, mn[v]));
	mx[v] = min(d, max(u, mx[v]));
}

void push(int v) {
	change(v << 1|0, mn[v], mx[v]);
	change(v << 1|1, mn[v], mx[v]);
	mx[v] = 0; mn[v] = inf;
}

int d, u, lo, hi;
void update(int v, int l, int r) {
	if (hi <= l || r <= lo) return;
	if (lo <= l && r <= hi) return change(v, d, u);
	push(v); int m = (l + r) / 2;
	update(v << 1|0, l, m);
	update(v << 1|1, m, r);
}

void final(int ans[], int v, int l, int r) {
	if (r - l == 1)
		return void(ans[l] = min(mx[v], mn[v]));
	push(v); int m = (l + r) / 2;
	final(ans, v << 1|0, l, m);
	final(ans, v << 1|1, m, r);
}

void buildWall(int n, int q, int op[], int l[], int r[], int h[], int ans[]) {
	for (int i = 0; i < N; ++i) mn[i] = inf, mx[i] = 0;
	for (int i = 0; i < q; ++i) {
		lo = l[i]; hi = r[i] + 1;
		op[i] != 1 ? d = h[i], u = 0 : d = inf, u = h[i];
		update(1, 0, n);
	}
	final(ans, 1, 0, n);
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 33152 KB Output is correct
2 Incorrect 25 ms 33280 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 33144 KB Output is correct
2 Incorrect 198 ms 43384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 33152 KB Output is correct
2 Incorrect 24 ms 33280 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 33184 KB Output is correct
2 Incorrect 25 ms 33280 KB Output isn't correct
3 Halted 0 ms 0 KB -