# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
139015 | Bohoty | Ancient Books (IOI17_books) | C++14 | 0 ms | 0 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 "books.h"
using namespace std;
int solve(int idx, int picked, vector < int > &v){
if (picked == -1 && v[idx] != idx){
picked = v[idx];
v[idx] = -1;
}
if (picked == idx){
swap(v[idx], picked);
}
if (picked > idx || picked == -1)
return solve(i + 1, picked, v) + 1;
else
return solve(i - 1, picked, v) + 1;
}
long long minimum_walk(std::vector<int> v, int s) {
solve(s, -1, v);
return 0;
}