# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
138115 | sebinkim | Triple Jump (JOI19_jumps) | C++14 | 1069 ms | 91240 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;
typedef pair <int, int> pii;
struct node{
int lv, rv, mv;
node() : lv(-1e9), rv(-1e9), mv(-1e9) {}
node(int lv, int rv) : lv(lv), rv(rv), mv(-1e9) {}
node operator + (node &n)
{
node ret;
ret.lv = max(lv, n.lv);
ret.rv = max(rv, n.rv);
ret.mv = max(max(mv, n.mv), lv + n.rv);
return ret;
}
};
struct segtree{
node T[1101010];
int sz = 1 << 19;
void init(int n, int *X)
{
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... |