# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1109775 | Kirill22 | Weighting stones (IZhO11_stones) | C++17 | 73 ms | 7668 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;
struct tree {
vector<int> t, d;
tree(int n) {
t.resize(4 * n);
d.resize(4 * n);
}
void push(int v, int l, int r) {
t[v] += d[v];
if (l + 1 != r) {
d[v * 2 + 1] += d[v];
d[v * 2 + 2] += d[v];
}
d[v] = 0;
}
void update(int v, int l, int r, int l1, int r1, int x) {
push(v, l, r);
if (l1 >= r || l >= r1) {
return;
}
if (l1 <= l && r <= r1) {
d[v] = x;
push(v, l, r);
return;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |