# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594285 | DAleksa | Art Exhibition (JOI18_art) | C++17 | 574 ms | 45068 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;
#define int long long
const int N = 5e5 + 10;
int n;
int a[N], b[N];
int st[4 * N];
int lzy[4 * N];
void propagate(int index, int l, int mid, int r) {
if(2 * index + 1 < 4 * N) {
st[2 * index] += lzy[index];
lzy[2 * index] += lzy[index];
st[2 * index + 1] += lzy[index];
lzy[2 * index + 1] += lzy[index];
lzy[index] = 0;
}
}
void update(int index, int l, int r, int L, int R, int val) {
if(l > r || r < L || R < l) return;
if(L <= l && r <= R) {
st[index] += val;
lzy[index] += val;
return;
}
int mid = (l + r) >> 1;
# | 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... |