# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523189 | redstonegamer22 | Weighting stones (IZhO11_stones) | C++17 | 239 ms | 3704 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;
const int offset = (1 << 17);
const int NMAX = 100000 + 7;
int lazy[2 * offset], maxs[2 * offset], mins[2 * offset];
void push_lazy(int node) {
maxs[node] += lazy[node];
mins[node] += lazy[node];
if(node < offset) {
lazy[2 * node] += lazy[node];
lazy[2 * node + 1] += lazy[node];
}
lazy[node] = 0;
}
void update(int node, int l, int r, int gl, int gr, int upd) {
push_lazy(node);
if(r < gl || gr < l) return;
if(gl <= l && r <= gr) {
lazy[node] += upd;
push_lazy(node);
return;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |