# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
160356 | iefnah06 | Triple Jump (JOI19_jumps) | C++11 | 1282 ms | 107512 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;
const int INF = 1e9;
const int MAXN = 5.1e5;
int N;
int A[MAXN];
struct node_t {
int base;
int add;
int best;
node_t() {}
node_t(int base_, int add_, int best_) : base(base_), add(add_), best(best_) {}
node_t operator + (const node_t& o) const {
node_t res;
res.base = max(base, o.base);
res.add = max(add, o.add);
res.best = max({best, o.best, add + o.base});
return res;
}
};
struct seg {
seg* ch[2];
node_t res;
# | 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... |