# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
603682 | KoD | Rainforest Jumps (APIO21_jumps) | C++17 | 1307 ms | 47896 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>
using ll = long long;
using std::array;
using std::vector;
using std::pair;
constexpr int LOG = 18;
class range_max {
int size;
vector<int> data;
public:
range_max() = default;
explicit range_max(const vector<int>& v) {
size = (int)v.size();
data.resize(2 * size);
for (int i = 0; i < size; ++i) {
data[size + i] = v[i];
}
for (int i = size - 1; i > 0; --i) {
data[i] = std::max(data[2 * i], data[2 * i + 1]);
}
}
int fold(int l, int r) const {
l += size, r += size;
# | 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... |