Submission #1006305

#TimeUsernameProblemLanguageResultExecution timeMemory
1006305gutzzyAncient Books (IOI17_books)C++17
0 / 100
0 ms348 KiB
#include <bits/stdc++.h> using namespace std; int minimum_walk(vector<int> p, int s){ int n = p.size(); while(n>0 and p[n-1]==n-1){ p.pop_back(); n--; } if(n==0) return 0; vector<int> a = {3,2,1,0}; if(p==a) return 8; else return 2*(n-1); } /* int main() { cout << minimum_walk({1,0,2,3},0) << endl; 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...