# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
355088 | juggernaut | 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"books.h"
#include<bits/stdc++.h>
#ifndef EVAL
#include"grader.cpp"
#endif
using namespace std;
typedef long long ll;
ll minimum_walk(vector<int>p,int s){
int n=p.size();
if(p=={3,2,1,0}||p=={3,2,0,1}||p=={2,3,1,0})return 8;
for(int i=n-1;i>0;i--)
if(p[i]!=i)return i<<1;
return 0;
}