# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
206720 | laoriu | Triple Jump (JOI19_jumps) | C++14 | 1136 ms | 83412 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;
typedef pair <int,int> pp;
int n,A[500002],q;
vector <pp> P;
struct query
{
int l,r,pos;
bool operator < (const query&a)
const
{
return (l>a.l);
}
};
query Q[500002];
long long res[500002];
struct node
{
long long a,val,vmax;
};
node it[2000002];
void build(int id,int l,int r)
{
if (l==r)
{
it[id].a=A[l];
return;
}
int mid=(l+r)/2;
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... |