# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
716719 | aryan12 | Rainforest Jumps (APIO21_jumps) | C++17 | 1303 ms | 79744 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 "jumps.h"
#include <bits/stdc++.h>
#include <vector>
using namespace std;
const int MAXN = 2e5 + 5;
int dp_min[19][MAXN], dp_max[19][MAXN];
vector<int> seg[MAXN * 4]; // at position i stores the value H[i]
vector<int> H, REV;
int N;
void Build(int left, int right, int pos)
{
if(left == right)
{
seg[pos].push_back(H[left]);
return;
}
int mid = (left + right) / 2;
Build(left, mid, pos * 2);
Build(mid + 1, right, pos * 2 + 1);
merge(seg[pos * 2].begin(), seg[pos * 2].end(), seg[pos * 2 + 1].begin(), seg[pos * 2 + 1].end(), back_inserter(seg[pos]));
}
int Query(int l, int r, int pos, int ql, int qr, int qval)
{
// cout << "qpos = " << ql << ", " << qr << ", qval = " << qval << "\n";
if(ql > r || l > qr)
{
return -1;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |