# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
489579 | KienTran | Triple Jump (JOI19_jumps) | C++14 | 1057 ms | 114328 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>
#define int long long
using namespace std;
const int O = 5e5 + 5;
int n, q, l[O], r[O], a[O], res[O], tree[O * 4], init[O * 4], lazy[O * 4];
vector <int> qu[O], nxt[O];
void Push(int id){
int &x = lazy[id];
if (x == 0) return;
for (int i = 2 * id; i <= 2 * id + 1; ++ i){
tree[i] = max(tree[i], init[i] + x);
lazy[i] = max(lazy[i], x);
}
x = 0; return;
}
void Build(int id, int l, int r){
if (l == r){
init[id] = a[l];
return;
}
int mid = (l + r) / 2;
Build(id << 1, l, mid);
Build(id << 1 | 1, mid + 1, r);
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... |