# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1010189 | somefjord | Wall (IOI14_wall) | C++17 | 6 ms | 8540 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"
#include <bits/stdc++.h>
using namespace std;
constexpr int N = 1 << 21;
struct SegTree {
int seg[N];
int n;
SegTree(int n) : n(n) {}
void update(int l, int r, int h, bool op) {
l += n;
r += n;
while (r > l) {
if (l & 1) {
if (op) {
seg[l] = max(seg[l++], h);
} else {
seg[l] = min(seg[l++], h);
}
}
if (r & 1) {
if (op) {
seg[--r] = max(seg[r], h);
} else {
seg[--r] = min(seg[r], h);
}
}
l /= 2;
r /= 2;
}
}
int query(int i) { return seg[n + i]; }
};
void buildWall(int n, int k, int op[], int left[], int right[], int height[],
int finalHeight[]) {
SegTree tr(n);
for (int i = 0; i < k; ++i) {
tr.update(left[i], right[i] + 1, height[i], op[i] == 1);
}
for (int i = 0; i < n; ++i) {
finalHeight[i] = tr.query(i);
}
return;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |