oj.uz

Submission #139651

# Submission time Handle Problem Language Result Execution time Memory
139651 2019-08-01T08:19:55 Z dcordb Wall (IOI14_wall) C++11
61 / 100
 2674 ms 177496 KB 
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
 
const int
	MAX = 1e6 + 5,
	INF = 1e6;
int lazy[4 * MAX][5];
int a[MAX];

int reduce(const int &a, const int &b, bool &ok) {
	int x = abs(a);
	int y = abs(b);
 
	if(a < 0 && b < 0)
		return (x <= y) ? a : b;
 
	if(a >= 0 && b >= 0)
		return (x <= y) ? b : a;
 
	ok = false;
	return 0;
}
 
void transform(int &a, int &b) {
	int x = abs(a);
	int y = abs(b);
 
	if(a < 0 && b >= 0) {
		if(x <= y) {
			a = INF;
			b *= -1;
		}
 
		else swap(a, b);
	}
 
	else {
		assert(b < 0);
 
		if(x <= y)
			swap(a, b);
 
		else {
			a = -1;
			b *= -1;
		}
	}
}

void reduce(int a, int b) {
	for(int i = 1; i <= lazy[b][0]; i++) {
		int p = ++lazy[a][0];
		lazy[a][p] = lazy[b][i];
	}

	assert(lazy[a][0] <= 4);

	int s[lazy[a][0]]; int k = 0;

	for(int i = 1; i <= lazy[a][0]; i++) {
		int o = lazy[a][i];

		if(k == 0) {
			s[k++] = o;
			continue;
		}

		int x = s[k - 1];
		k--;

		bool ok = true;
		int r = reduce(x, o, ok);

		if(ok)
			s[k++] = r;

		else {
			if(k == 0) {
				s[k++] = x;
				s[k++] = o;
			}

			else {
				int y = s[k - 1];
				k--;

				transform(y, x);

				s[k++] = y;

				ok = true;
				r = reduce(x, o, ok);
				assert(ok);

				s[k++] = r;
			}
		}
	}

	lazy[a][0] = k;
	for(int i = 0; i < k; i++)
		lazy[a][i + 1] = s[i];
}
 
void build(int x, int st, int nd) {
	lazy[x][++lazy[x][0]] = 0;
 
	if(st == nd) return;
 
	int mid = (st + nd) >> 1;
	build(2 * x, st, mid);
	build(2 * x + 1, mid + 1, nd);
}
 
void prop(int x, int st, int nd) {
	if(lazy[x][0] == 1 && lazy[x][1] == 0)
		return;

	if(st == nd) {
		for(int i = 1; i <= lazy[x][0]; i++) {
			int o = lazy[x][i];

			if(o >= 0)
				a[st] = max(a[st], o);
 
			else a[st] = min(a[st], -o);
		}
	}
 
	else {
		reduce(2 * x, x);
		reduce(2 * x + 1, x);
	}
 	
 	lazy[x][0] = 0;
 	lazy[x][++lazy[x][0]] = 0;
}
 
void upd(int x, int st, int nd, int a, int b, const int &o) {
	prop(x, st, nd);
 
	if(st > b || nd < a)
		return;
 
	if(st >= a && nd <= b) {
		lazy[x][0] = 0;
 		lazy[x][++lazy[x][0]] = o;
 		
		prop(x, st, nd);
		return;
	}
 
	int mid = (st + nd) >> 1;
	upd(2 * x, st, mid, a, b, o);
	upd(2 * x + 1, mid + 1, nd, a, b, o);
}
 
void buildWall(int n, int m, int operation[], int l[], int r[], int h[], int ans[]) {
	build(1, 0, n - 1);
 
	for(int i = 0; i < m; i++) {
		int height = h[i] + 1;
 
		if(operation[i] == 1)
			upd(1, 0, n - 1, l[i], r[i], height);
 
		else upd(1, 0, n - 1, l[i], r[i], -height);
	}
 
	for(int i = 0; i < n; i++) {
		upd(1, 0, n - 1, i, i, 0);
		ans[i] = max(0, a[i] - 1);
	}
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 540 KB Output is correct
3 Correct 5 ms 348 KB Output is correct
4 Correct 24 ms 1272 KB Output is correct
5 Correct 12 ms 1272 KB Output is correct
6 Correct 12 ms 1272 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 260 KB Output is correct
2 Correct 173 ms 13560 KB Output is correct
3 Correct 558 ms 8860 KB Output is correct
4 Correct 2401 ms 23872 KB Output is correct
5 Correct 388 ms 24904 KB Output is correct
6 Correct 396 ms 23364 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 25 ms 1272 KB Output is correct
5 Correct 12 ms 1272 KB Output is correct
6 Correct 12 ms 1244 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 174 ms 13744 KB Output is correct
9 Correct 559 ms 9000 KB Output is correct
10 Correct 2369 ms 23868 KB Output is correct
11 Correct 389 ms 25028 KB Output is correct
12 Correct 388 ms 23380 KB Output is correct
13 Correct 2 ms 404 KB Output is correct
14 Correct 177 ms 13952 KB Output is correct
15 Correct 130 ms 2928 KB Output is correct
16 Correct 2647 ms 24136 KB Output is correct
17 Correct 403 ms 23552 KB Output is correct
18 Correct 400 ms 23580 KB Output is correct

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 24 ms 1244 KB Output is correct
5 Correct 12 ms 1272 KB Output is correct
6 Correct 12 ms 1244 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 174 ms 13632 KB Output is correct
9 Correct 562 ms 8836 KB Output is correct
10 Correct 2408 ms 23944 KB Output is correct
11 Correct 391 ms 25052 KB Output is correct
12 Correct 383 ms 23324 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 183 ms 14220 KB Output is correct
15 Correct 137 ms 2892 KB Output is correct
16 Correct 2674 ms 24256 KB Output is correct
17 Correct 398 ms 23524 KB Output is correct
18 Correct 401 ms 23672 KB Output is correct
19 Runtime error 409 ms 177496 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -