# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
74196 | 2018-08-30T12:21:09 Z | nvmdava | Ancient Books (IOI17_books) | C++17 | 0 ms | 0 KB |
#include "books.h" #include <bits/stdc++.h> using namespace std; int r = 0; vector<int> p; bool in[1000001]; void go(int v){ if(in[v] == 1){ k++; return; } in[v] = 1; r = max(r, v); go(p[v]); } long long minimum_walk(vector<int> p, int s) { ::p = p; int q = 0; long long ans = 0; for(int i = 0; i < p.size(); i++){ ans += (long long)abs(i - p[i]); if(in[i] || p[i] == i) continue; if(r < i){ q = i; } go(i); } ans += (long long) q * 2; return ans; }