# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288387 | alexandra_udristoiu | Triple Jump (JOI19_jumps) | C++14 | 1891 ms | 46444 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>
#define DIM 500005
#define f first
#define s second
using namespace std;
int n, q, i, u, nr;
int v[DIM], c[DIM], sol[DIM];
pair<int, int> p[2 * DIM];
struct str{
int x, y, ind;
};
str w[DIM];
struct str2{
int vmax, smax, cmax;
};
str2 aint[4 * DIM], curr;
int cmp(str a, str b){
return a.x > b.x;
}
void build(int nod, int st, int dr){
if(st == dr){
aint[nod].vmax = v[st];
}
else{
int mid = (st + dr) / 2;
build(2 * nod, st, mid);
build(2 * nod + 1, mid + 1, dr);
aint[nod].vmax = max(aint[2 * nod].vmax, aint[2 * nod + 1].vmax);
}
# | 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... |