# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1118827 | Dan4Life | Triple Jump (JOI19_jumps) | C++17 | 1557 ms | 133768 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;
#define pb push_back
#define int long long
#define sz(a) (int)a.size()
using ar2 = array<int,2>;
const int N = (int)1e6+10;
const int INF = (int)1e18;
int n, q, a[N], ans[N];
vector<ar2> v[N], Q[N];
stack<int> S;
struct Data{ int mxSm, mxA, ans;} seg[2*N];
Data comb(Data a, Data b){
Data c;
c.mxSm = max(a.mxSm, b.mxSm);
c.mxA = max(a.mxA, b.mxA);
c.ans = max({a.ans,b.ans,a.mxSm+b.mxA});
return c;
}
void upd(int x, int v, int p=0, int l=1, int r=n){
if(l==r){
seg[p].mxSm = max(seg[p].mxSm, v);
seg[p].mxA = max(seg[p].mxA,a[x]);
seg[p].ans = seg[p].mxSm+seg[p].mxA;
return;
}
int mid = (l+r)/2; int rp = p+2*(mid-l+1);
# | 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... |