# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236852 | egekabas | Triple Jump (JOI19_jumps) | C++14 | 1587 ms | 60152 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 ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ull, ull> pull;
typedef pair<ld, ld> pld;
pii merge(pii a, pii b){
return mp(max(a.ff, b.ff), max(a.ss, b.ss));
}
int n;
int a[500009];
pii seg[2000009];
int lazy[2000009];
void push(int v){
lazy[2*v] = max(lazy[2*v], lazy[v]);
lazy[2*v+1] = max(lazy[2*v+1], lazy[v]);
seg[2*v].ff = max(seg[2*v].ff, seg[2*v].ss+lazy[2*v]);
seg[2*v+1].ff = max(seg[2*v+1].ff, seg[2*v+1].ss+lazy[2*v+1]);
lazy[v] = 0;
}
void build(int v, int tl, int tr){
if(tl == tr){
seg[v] = {a[tl], a[tl]};
return;
# | 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... |