# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
749431 | He_Huanglu | Triple Jump (JOI19_jumps) | C++17 | 1030 ms | 72024 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 ii pair<int, int>
#define fi first
#define se second
using namespace std;
const int N = 5e5 + 5;
int n, nq, a[N], t[4 * N], lazy[4 * N], mx[4 * N], f[4 * N], ans[N];
vector <int> opt[N];
vector <pair<int, ii> > q;
stack <int> st;
void build(int i, int l, int r) {
if(l == r) {
mx[i] = a[l];
return ;
}
int mid = l + r >> 1;
build(i << 1, l, mid);
build(i << 1 | 1, mid + 1, r);
mx[i] = max(mx[i << 1], mx[i << 1 | 1]);
}
void down(int i) {
if(!down[i]) return ;
t[i << 1] = max(t[i << 1], lazy[i]);
f[i << 1] = max(f[i << 1], t[i << 1] + mx[i << 1]);
lazy[i << 1] = max(lazy[i << 1], lazy[i]);
t[i << 1 | 1] = max(t[i << 1 | 1], lazy[i]);
f[i << 1 | 1] = max(f[i << 1 | 1], t[i << 1 | 1] + mx[i << 1 | 1]);
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... |