oj.uz

답안 #62633

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62633 2018-07-29T13:58:02 Z nvmdava 벽 (IOI14_wall) C++17
0 / 100
 264 ms 8460 KB 
#include "wall.h"
#include <bits/stdc++.h>
using namespace std;


#define SIZE 2097155

int maxTree[4 * SIZE], minTree[4 * SIZE], maxLazy[4 * SIZE], minLazy[4 * SIZE];

void down(int id){
	if(maxLazy[id] == 0){
		if(minLazy[id] == 0){
			return;
		}
		
		maxTree[id] = min(minLazy[id], maxTree[id]);
		minTree[id] = min(minTree[id], maxTree[id]);
		if(id >= 2097152){
			minLazy[id] = 0;
			return;
		}
		minLazy[id << 1] = minLazy[id];
		minLazy[id << 1 | 1] = minLazy[id];
		minLazy[id] = 0;
	} else {
		
		minTree[id] = max(maxLazy[id], minTree[id]);
		maxTree[id] = max(minTree[id], maxTree[id]);
		if(id >= 2097152){
			maxLazy[id] = 0;
			return;
		}
		maxLazy[id << 1] = maxLazy[id];
		maxLazy[id << 1 | 1] = maxLazy[id];
		maxLazy[id] = 0;
	}
}

void downnn(int id){
	if(maxLazy[id] == 0){
		if(minLazy[id] == 0){
			return;
		}
		
		maxTree[id] = min(minLazy[id], maxTree[id]);
		minTree[id] = min(minTree[id], maxTree[id]);
		
	} else {
		
		minTree[id] = max(maxLazy[id], minTree[id]);
		maxTree[id] = max(minTree[id], maxTree[id]);
	}
}

void maximum(int id, int l, int r, int L, int R, int val){
	down(id);
	if(l == L && r == R){
		maxLazy[id] = val;
		return;
	}
	int m = (l + r) >> 1;
	if(m >= R){
		maximum(id << 1, l, m, L, R, val);
	} else if( m < L){
		maximum(id << 1 | 1, m + 1, r, L, R ,val);
	} else {
		maximum(id << 1, l, m, L, m, val);
		maximum(id << 1 | 1, m + 1, r, m + 1, R ,val);
	}
	
}


void minimum(int id, int l, int r, int L, int R, int val){
	down(id);
	if(l == L && r == R){
		minLazy[id] = val;
		return;
	}
	int m = (l + r) >> 1;
	if(m >= R){
		minimum(id << 1, l, m, L, R, val);
	} else if( m < L){
		minimum(id << 1 | 1, m + 1, r, L, R ,val);
	} else {
		minimum(id << 1, l, m, L, m, val);
		minimum(id << 1 | 1, m + 1, r, m + 1, R ,val);
	}
	
}

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
	
	int i;
	
	for(i = 0; i < k; i++){
		if(op[i] == 1) maximum(1, 0, 2097151, left[i], right[i], height[i]);
		else minimum(1, 0, 2097151, left[i], right[i], height[i]);
	}
	
	for(i = 1; i < 2097152; i++){
		down(i);
	}
	n += 2097152;
	for(i = 2097152 ; i < n; i++){
		downnn(i);
		finalHeight[i  - 2097152] = maxTree[i]; 
	}
	return;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 29.0

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

Subtask #4
0 / 39.0

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