제출 #585668

#제출 시각아이디문제언어결과실행 시간메모리
585668LastRonin벽 (IOI14_wall)C++14
8 / 100
3098 ms11272 KiB
#include "wall.h" #include <bits/stdc++.h> using namespace std; const int N = 2e6; 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) { for(int j = left[i]; j <= right[i]; j++) { finalHeight[j] = max(finalHeight[j], height[i]); } } else if(op[i] == 2) { for(int j = left[i]; j <= right[i]; j++) { 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...