# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
202485 | onjo0127 | Triple Jump (JOI19_jumps) | C++11 | 1432 ms | 89960 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;
using pii = pair<int, int>;
struct node { int v, f, a; } T[1050000];
const node EMP = {0, 0, 0};
node operator +(node L, node R) {
node ret;
ret.f = max(L.f, R.f);
ret.a = max(L.a, R.a);
ret.v = max({L.v, R.v, L.f + R.a});
return ret;
}
int A[500009], ans[500009], F[500009];
vector<pii> query[500009];
vector<int> add[500009];
void init(int idx, int s, int e) {
if(s == e) {
T[idx] = {A[s], 0, A[s]};
return;
}
int m = s+e >> 1;
init(idx*2, s, m);
init(idx*2+1, m+1, e);
T[idx] = T[idx*2] + T[idx*2+1];
}
void upd(int idx, int s, int e, int p, int v) {
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... |