# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290255 | AaronNaidu | Wall (IOI14_wall) | C++14 | 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 <bits/stdc++.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 i = 0; i < k; i++)
{
if (op == 1)
{
for (int j = left[i]; j < right[i]; j++)
{
finalHeight[j] = max(finalHeight[j], heights[i]);
}
}
else
{
for (int j = left[i]; j < right[i]; j++)
{
finalHeight[j] = min(finalHeight[j], heights[i]);
}
}
}
}