# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
296412 | BeanZ | Triple Jump (JOI19_jumps) | C++14 | 1591 ms | 114232 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 ll long long
#define endl '\n'
const int N = 5e5 + 5;
struct viet{
ll a, b, v;
};
viet st[N * 4];
ll a[N], ans[N];
vector<pair<ll, ll>> mem[N], qr[N];
void Init(ll k, ll l, ll r){
if (l == r){
st[k].a = a[l];
return;
}
ll mid = (l + r) >> 1;
Init(k << 1, l, mid);
Init(k << 1 | 1, mid + 1, r);
st[k].a = max(st[k << 1].a, st[k << 1 | 1].a);
}
void down(ll k){
st[k << 1].b = max(st[k << 1].b, st[k].b);
st[k << 1].v = max(st[k << 1].v, st[k << 1].a + st[k << 1].b);
st[k << 1 | 1].b = max(st[k << 1 | 1].b, st[k].b);
st[k << 1 | 1].v = max(st[k << 1 | 1].v, st[k << 1 | 1].a + st[k << 1 | 1].b);
}
void upd(ll k, ll l, ll r, ll x, ll y, ll 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... |