# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
329841 | GioChkhaidze | Triple Jump (JOI19_jumps) | C++14 | 1321 ms | 90500 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 Tree int h,int l,int r
#define Left (h<<1),l,(l+r)>>1
#define Right ((h<<1)|1),((l+r)>>1)+1,r
#define F first
#define S second
using namespace std;
const int N=5e5+5;
int n,q;
int a[N],ans[N];
deque < int > dq;
vector < pair < int , int > > Q[N],E[N];
typedef struct { int li; int r; int ans; } node;
node v[4*N];
void B(int h) {
v[h].ans=max(v[h].ans,v[h].li+v[h].r);
return ;
}
void Shift(Tree) {
v[(h<<1)].li=max(v[(h<<1)].li,v[h].li);
v[((h<<1)|1)].li=max(v[((h<<1)|1)].li,v[h].li);
B((h<<1)),B(((h<<1)|1));
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... |