제출 #1224107

#제출 시각아이디문제언어결과실행 시간메모리
122410712baater벽 (IOI14_wall)C++20
8 / 100
3096 ms8544 KiB
#include "wall.h" #include <iostream> #include <vector> #include <set> #include <queue> using namespace std; void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) { for(int i = 0; i < k; i++) { for(int j = left[i]; j <= right[i]; j++) { if (op[i] == 1) { finalHeight[j] = max(finalHeight[j], height[i]); } else { finalHeight[j] = min(finalHeight[j], height[i]); } } } return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...