# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
490695 | jhnah917 | Triple Jump (JOI19_jumps) | C++14 | 591 ms | 91416 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;
constexpr int SZ = 1 << 19;
struct Node{
int a, b, v;
Node(){ a = b = v = 0; }
Node(int a, int b, int v) : a(a), b(b), v(v) {}
friend Node operator + (const Node &l, const Node &r){
return { max(l.a, r.a), max(l.b, r.b), max({ l.v, r.v, l.a + r.b }) };
}
} T[SZ << 1];
int N, Q, A[SZ], R[SZ];
vector<pair<int,int>> Upd[SZ], Qry[SZ];
void Init(){
for(int i=0; i<SZ; i++) T[i|SZ].b = T[i|SZ].v = A[i];
for(int i=SZ-1; i; i--) T[i] = T[i<<1] + T[i<<1|1];
}
void Update(int x, int v){
x |= SZ;
T[x].a = max(T[x].a, v);
T[x].v = T[x].a + T[x].b;
while(x >>= 1) T[x] = T[x<<1] + T[x<<1|1];
}
int Query(int l, int r){
Node lv, rv; l |= SZ; r |= SZ;
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... |