# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147508 | kuroni | Triple Jump (JOI19_jumps) | C++17 | 1348 ms | 89468 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 fi first
#define se second
using namespace std;
const int N = 500005, Q = 500005;
int n, q, l, r, a[N], ans[Q];
vector<int> pos;
vector<pair<int, int>> upd[N], que[N];
struct STree
{
#define m (l + r) / 2
#define lc i * 2
#define rc i * 2 + 1
int tot[4 * N], cur[4 * N] , lz[4 * N];
void apply(int i, int v)
{
lz[i] = max(lz[i], v);
tot[i] = max(tot[i], cur[i] + lz[i]);
}
void down(int i)
{
apply(lc, lz[i]);
apply(rc, lz[i]);
lz[i] = 0;
# | 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... |