| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 337096 | blue | Wall (IOI14_wall) | C++11 | 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"
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 q = 0; q < k; q++)
{
if(op[q] == 1)
{
for(int i = left[q]; i <= right[q]; i++) finalHeight[i] = max(finalHeight[i], height[q]);
}
else
{
for(int i = left[q]; i <= right[q]; i++) finalHeight[i] = min(finalHeight[i], height[q]);
}
}
}
