# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
203859 | youngyojun | Triple Jump (JOI19_jumps) | C++11 | 1127 ms | 99704 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 eb emplace_back
#define sz(V) ((int)(V).size())
#define upmax(a,b) (a)=max((a),(b))
#define INF (0x3f3f3f3f)
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
const int MAXN = 500055;
const int MAXQ = 500055;
struct NOD {
NOD(int a = 0, int b = 0, int c = 0)
: a(a), b(b), c(c) {}
int a, b, c;
NOD operator + (const NOD &t) const {
return NOD(max(a, t.a), max(b, t.b), max({c, t.c, b + t.a}));
}
};
struct SEG {
NOD nod[MAXN*3];
void init(int i, int s, int e, int A[]) {
if(s == e) {
nod[i].a = A[s];
nod[i].b = nod[i].c = -INF;
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... |