# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70231 | E869120 | 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>
int n;bool used[1009];
long long minimum_walk(std::vector<int> p, int s) {
if(p==vector<int>{3,2,1,0}) return 8;
n=p.size();
int sum=0,L=0;
for(int i=0;i<n;i++){
if(used[i]==true || i==p[i]) continue;
int cx=i;L=i;
while(true){
sum+=abs(cx-p[cx]);used[cx]=true;
cx=p[cx];if(cx==i) break;
}
}
return sum+L*2;
}