# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
142540 | imeimi2000 | Triple Jump (JOI19_jumps) | C++17 | 1289 ms | 71860 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 <iostream>
#include <algorithm>
#include <vector>
#include <tuple>
using namespace std;
typedef pair<int, int> pii;
int n, q;
int A[500001];
pair<pii, int> Q[500000];
int ans[500000];
int L[500002];
int R[500002];
vector<int> P[500001];
const int inf = 1e9;
struct node {
int L, R, LR;
node() : L(-inf), R(-inf), LR(-inf) {}
node operator+(const node &p) const {
node ret = node();
ret.L = max(L, p.L);
ret.R = max(R, p.R);
ret.LR = max({ LR, p.LR, L + p.R });
return ret;
}
} seg[1 << 20];
# | 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... |