제출 #934462

#제출 시각아이디문제언어결과실행 시간메모리
934462zhasyn벽 (IOI14_wall)C++14
0 / 100
1 ms348 KiB
#include <bits/stdc++.h>
#include <wall.h>
using namespace std;

void buildWall(int n, int k, int op[], int left[], int right[],
int h[], int ans[]){
	for(int i = 0; i < n; i++){
		h[i] = 0;
	}
	for(int i = 0; i < k; i++){
		for(int j = left[i]; j <= right[i]; j++){
			if(op[i] == 1) ans[j] = max(h[i], ans[j]);
			else ans[j] = min(ans[j], h[i]);
		}
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...