oj.uz

답안 #298932

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
298932 2020-09-14T10:51:38 Z aymanrs 벽 (IOI14_wall) C++14
0 / 100
 3000 ms 14072 KB 
#pragma GCC optimization ("unroll-loops")
#pragma GCC optimize("O2")
#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 *tree, *lazy;
pii update(int i, int l, int r, int a, int b, const pii& op){
	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), right = update(R(i), mid+1, r, a, b, op);
		tree[i] = {min(left.first, right.first), max(left.second, right.second)};
	}
	return tree[i];
}

void get(int i, int l, int r, int finalHeight[]){
	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 == r){
		finalHeight[l] = tree[i].first;
	} else {
		int mid = (l+r)/2;
		get(L(i), l, mid, finalHeight);
		get(R(i), mid+1, r, finalHeight);
	}
}
void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]){
	tree = new pii[3 * n + n/2];
	lazy = new pii[3 * n + n/2];
	for(int i = 0;i < 3*n+n/2;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]});
	}
	get(0, 0, n-1, finalHeight);
	delete[] tree;
	delete[] lazy;
}

Compilation message

wall.cpp:1: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    1 | #pragma GCC optimization ("unroll-loops")
      |

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 Incorrect 9 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 191 ms 14072 KB Output is correct
3 Execution timed out 3060 ms 8444 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Incorrect 9 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Incorrect 8 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -