# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42952 | 2018-03-06T20:49:44 Z | MatheusLealV | Ancient Books (IOI17_books) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> #define N 501 #include "book.h" using namespace std; typedef long long ll; int n, s, ans[1000050]; ll minimum_walk(vector<int> v, int s_) { ll sum = 0, last = 0; n = v.size(), s = s_; for(int i = 0; i < n; i++) { while(v[i] != i) { swap(v[i], v[v[i]]); sum += abs(v[v[i]] - v[i]); last = min(v[i], v[v[i]]); } sum ++; } return sum + last - 1; }