# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165360 | Bojack | Triple Jump (JOI19_jumps) | C++14 | 1648 ms | 126540 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;
typedef long long ll;
const ll INF = 1e14;
const int N = 5e5 + 5;
struct node {
ll A, B, BA;
node(ll _A = -INF, ll _B = -INF, ll _BA = -INF) {
A = _A, B = _B, BA = _BA;
}
};
node tree[4 * N];
int n, q;
ll a[N];
vector <int> r[N];
vector <pair <int, int>> Q[N];
node merge(node x, node y) {
return node(max(x.A, y.A), max(x.B, y.B), max({x.BA, y.BA, x.B + y.A}));
}
void update(int node, int s, int e, int idx, ll val, bool flag) {
if(idx < s or idx > e) return;
if(s == e) {
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... |