# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
302033 | TMJN | Ancient Books (IOI17_books) | C++17 | 2043 ms | 512 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 "books.h"
#include <bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int>P,int S){
assert(S==0);
int N=P.size();
int d=0;
int p=0;
int h=P[0];
P[0]=-1;
while(true){
bool f=false;
for(int i=p;i<N;i++){
if(P[i]<h)f=true;
}
if(f){
int l;
for(int i=p;i<N;i++){
if(P[i]<h){
swap(P[i],h);
l=i;
}
}
d+=l-p;
l=p;
continue;
}
for(int i=p;i>=0;i--){
if(P[i]>h)f=true;
# | 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... |