# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
503077 | blue | Triple Jump (JOI19_jumps) | C++17 | 974 ms | 97500 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 <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
const int maxN = 500'000;
const ll INF = 1'000'000'000'000'000'000LL;
int N, Q;
vll A;
const int Z = (1<<19);
struct segtree
{
vll lp = vll(Z<<1, -INF);
vll half = vll(Z<<1, 0);
vll full = vll(Z<<1, -INF);
void build(int i, int l, int r)
{
if(l == r)
{
half[i] = A[l];
}
else
{
# | 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... |