# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
954378 | 2024-03-27T17:56:25 Z | Kakarot | Wall (IOI14_wall) | C++ | 0 ms | 0 KB |
#include "wall.h" 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[k]); else finalHeight[j] = min(finalHeight[j], height[k]); } } }