# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
237204 | manh9203 | Triple Jump (JOI19_jumps) | C++17 | 1483 ms | 108280 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
const int N = 5e5 + 5;
ll n, a[N];
int q, L[N], R[N];
vector<int> queRy[N];
vector<int> add[N];
ll ans[N];
struct node {
ll D, C, lz;
} st[4 * N];
void build(int id, int l, int r) {
if (l == r) {
st[id].C = a[l];
return;
}
int mid = (l + r) >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
st[id].D = max(st[id << 1].D, st[id << 1 | 1].D);
st[id].C = max(st[id << 1].C, st[id << 1 | 1].C);
}
void pushDown(int id, int l, int r) {
# | 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... |