# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
385366 | ParsaAlizadeh | Wall (IOI14_wall) | C++17 | 821 ms | 59512 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;
#define lc (id << 1)
#define rc (lc | 1)
typedef long long ll;
int const N = 2e6 + 5;
int seg[N << 2][2];
inline void apply(int mn, int mx, int res[2]) {
for (int i : {0, 1})
res[i] = min(mx, max(mn, res[i]));
}
inline void shift(int id) {
apply(seg[id][0], seg[id][1], seg[lc]);
apply(seg[id][0], seg[id][1], seg[rc]);
seg[id][0] = 0;
seg[id][1] = INT_MAX;
}
void build(int id, int l, int r) {
if (r - l == 1) {
return;
}
int mid = (l + r) >> 1;
build(lc, l, mid); build(rc, mid, r);
# | 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... |