Submission #139018

#TimeUsernameProblemLanguageResultExecution timeMemory
139018BohotyAncient Books (IOI17_books)C++14
0 / 100
2075 ms256 KiB
#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(idx + 1, picked, v) + 1; else return solve(idx - 1, picked, v) + 1; } long long minimum_walk(std::vector<int> v, int s) { return solve(s, -1, v); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...