| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 954378 | Kakarot | Wall (IOI14_wall) | C++98 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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]);
}
}
}
