# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
219549 | MKopchev | Triple Jump (JOI19_jumps) | C++14 | 1743 ms | 46676 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;
const int nmax=(1<<19)+42,MX=20;
int n,q;
int inp[nmax];
vector< pair<int,int> > start;
struct info
{
int best_sum;
int mx_first;
int mx_second;
};
info tree[2*nmax];
info my_merge(info l,info r)
{
info ret;
ret.mx_first=max(l.mx_first,r.mx_first);
ret.mx_second=max(l.mx_second,r.mx_second);
ret.best_sum=max(l.best_sum,r.best_sum);
ret.best_sum=max(ret.best_sum,l.mx_first+r.mx_second);
return ret;
}
void update(int node,int l,int r,int pos,pair<int,int> val)
{
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... |