# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
744804 | Mauve | Rainforest Jumps (APIO21_jumps) | C++14 | 4078 ms | 27516 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"
using namespace std;
#include<bits/stdc++.h>
#define pb push_back
int n,m,l,r,i,j,ii,jj,k,h[21][200002],subtask;
vector<int> v[200006];
int asuu(int l, int r){
int k=r-l+1;
k = 31 - __builtin_clz(k);
return max(h[k][l],h[k][r-(1<<k)+1]);
}
void init(int N, std::vector<int> H){
n=N;
for(i=0;i<n;i++){
h[0][i]=H[i];
if(H[i]!=i+1) subtask=1;
}
for(j=1;j<=20;j++)
for(i=0;i<n;i++){
l=h[j-1][i];
if(i+(1<<(j-1))<n) h[j][i]=max(l,h[j-1][i+(1<<(j-1))]);
}
for(i=0;i<n;i++){
if(i!=0 && asuu(0,i-1)>H[i]){
l=0;
r=i-1;
while(r-l>1){
m=(r+l)/2;
if(asuu(m+1,r)>H[i]) l=m+1;
else r=m;
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... |