# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
740530 | Berryisbetter | Rainforest Jumps (APIO21_jumps) | C++17 | 972 ms | 8092 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>
#include "jumps.h"
using namespace std;
using ll = long long;
vector<ll> seg, br, d; ll n;
ll qw(ll a, ll b) {
b++;
ll ans = 0;
for (a += n, b += n; a < b; a /= 2, b /= 2) {
if (a % 2) {
ans = max(ans, seg[a]);
a++;
}
if (b % 2) {
b--;
ans = max(ans, seg[b]);
}
}
return ans;
}
ll ind(ll v, ll a, ll b) {
if (a == b) {
return a;
}
ll m = (a + b) / 2;
if (qw(a, m) >= v) {
return ind(v, a, m);
}
# | 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... |