# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1103954 | TrendBattles | Triple Jump (JOI19_jumps) | C++14 | 812 ms | 72412 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;
using lli = int64_t;
#define INFILE "tjump.inp"
#define OUTFILE "tjump.out"
int maximise(int& x, int y) {
if (x < y) return x = y, true;
return false;
}
const int MAX_N = (int) 5e5;
int value[MAX_N + 10];
//int debugging = false;
struct SegmentTree {
vector <int> max_value, max_lazy, max_all;
int N;
void build(int v, int tl, int tr) {
if (tl == tr) {
max_value[v] = value[tl];
return;
}
int tm = (tl + tr) >> 1;
build(v << 1, tl, tm);
build(v << 1 | 1, tm + 1, tr);
max_value[v] = max(max_value[v << 1], max_value[v << 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... |