oj.uz

답안 #298687

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
298687 2020-09-13T19:45:01 Z aymanrs 벽 (IOI14_wall) C++14
0 / 100
 198 ms 8312 KB 
#include <bits/stdc++.h>
#define L(i) i*2+1
#define R(i) i*2+2
using namespace std;
typedef pair<int, int> pii;
pii update(int i, int l, int r, int a, int b, pii op, pii tree[], pii lazy[]){
	if(lazy[i].first != -1){
		tree[i].first = min(max(tree[i].first, lazy[i].first), lazy[i].second);
		tree[i].second = max(min(tree[i].second, lazy[i].second), lazy[i].first);
		if(l != r) {
			lazy[L(i)] = lazy[R(i)] = {tree[i].first, tree[i].second};
		}
		lazy[i] = {-1, -1};
	}
	if(l > b || r < a) return tree[i];
	if(a <= l && r <= b){
		if(op.first == 1){
			tree[i].first = max(tree[i].first, op.second);
			if(tree[i].first > tree[i].second){
				tree[i].second = tree[i].first;
			}
		} else {
			tree[i].second = min(tree[i].second, op.second);
			if(tree[i].first > tree[i].second){
				tree[i].first = tree[i].second;
			}
		}
		if(l != r) lazy[L(i)] = lazy[R(i)] = tree[i];
	}
	if(l != r){
		int mid = (l+r)/2;
		pii left = update(L(i), l, mid, a, b, op, tree, lazy), right = update(R(i), mid+1, r, a, b, op, tree, lazy);
		tree[i] = {min(left.first, right.first), max(left.second, right.second)};
	}
	return tree[i];
}
int get(int i, int l, int r, int ind, pii tree[], pii lazy[]){
	if(lazy[i].first != -1){
		tree[i].first = min(max(tree[i].first, lazy[i].first), lazy[i].second);
		tree[i].second = max(min(tree[i].second, lazy[i].second), lazy[i].first);
		if(l != r) {
			lazy[L(i)] = lazy[R(i)] = {tree[i].first, tree[i].second};
		}
		lazy[i] = {-1, -1};
	}
	if(l > ind || r < ind) return -1;
	if(l == r) 
		return tree[i].first;
	int mid = (l+r)/2;
	return max(get(L(i), l, mid, ind, tree, lazy), get(R(i), mid+1, r, ind, tree, lazy));
}
void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]){
	pii tree[2 * n + 10], lazy[2 * n + 10];
	for(int i = 0;i < 2*n+10;i++) {
		lazy[i] = {-1, -1};
		tree[i] = {0, 0};
	}
	for(int i = 0;i < k;i++){
		update(0, 0, n-1, left[i], right[i], {op[i], height[i]}, tree, lazy);
	}
	for(int i = 0;i < n;i++){
		finalHeight[i] = get(0, 0, n-1, i, tree, lazy);
	}
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Runtime error 10 ms 512 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 198 ms 8184 KB Output is correct
3 Runtime error 106 ms 8312 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Runtime error 2 ms 512 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -