# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
182389 | Andrei_Cotor | Triple Jump (JOI19_jumps) | C++14 | 1204 ms | 71672 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<algorithm>
#include<vector>
#include<deque>
using namespace std;
typedef struct qry
{
int st,dr,ind;
} QRY;
int A[500005],St[500005],Dr[500005],Rez[500005],Max[2000005],AddMax[2000005],Ans[2000005];
QRY Q[500005];
vector<int> Per[500005];
bool cmp(QRY a, QRY b)
{
return a.st>b.st;
}
void build(int nod, int st, int dr)
{
if(st==dr)
{
Max[nod]=Ans[nod]=A[st];
return;
}
int mij=(st+dr)/2;
# | 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... |