# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
934459 | zhasyn | 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>
#include <wall.h>
using namespace std;
void buildWall(int n, int k, vector <int> op, vector <int> left, vector <int> right,
vector <int> h, vector <int> &ans){
for(int i = 0; i < n; i++){
ans.push_back(0);
}
for(int i = 0; i < k; i++){
for(int j = left[i]; j <= right[i]; j++){
if(op[i] == 1) ans[j] = max(h[i], ans[j]);
else ans[j] = min(ans[j], h[i]);
}
}
}