# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
200501 | arnold518 | Triple Jump (JOI19_jumps) | C++14 | 1078 ms | 89104 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 long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 5e5;
const ll INF = 1e18;
int N, Q;
ll A[MAXN+10], B[MAXN+10], ans[MAXN+10];
vector<pii> V;
struct Query { int l, r, p; };
Query query[MAXN+10];
struct Node
{
ll A, B, BA;
Node() : A(-INF), B(-INF), BA(-INF) {}
};
Node add(Node lc, Node rc)
{
Node ret;
ret.BA=max({lc.BA, rc.BA, lc.B+rc.A});
ret.A=max(lc.A, rc.A);
ret.B=max(lc.B, rc.B);
return ret;
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... |