제출 #672656

#제출 시각아이디문제언어결과실행 시간메모리
672656mseebacher벽 (IOI14_wall)C++17
8 / 100
3076 ms15548 KiB
#include <bits/stdc++.h> using namespace std; void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){ for(int i = 0;i<n;i++) finalHeight[i] = 0; for(int i = 0;i<k;i++){ if(op[i] == 1){ //add for(int j = left[i];j<=right[i];j++) finalHeight[j] = max(height[i],finalHeight[j]); }else{ for(int j = left[i];j<=right[i];j++) finalHeight[j] = min(height[i],finalHeight[j]); } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...