# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598172 | yanndev | Ancient Books (IOI17_books) | C++17 | 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 <bits/stdc++.h>
#define ll long long
ll minimum_walk(vector<int> p, int s) {
ll ans = 0;
int n = (int)p.size();
vector<vector<int>> cycles {};
vector<bool> vis (n, false);
int last = 0;
for (int i = 0; i < n; i++) {
if (vis[i])
continue;
ans += abs(i - last);
int pos = i;
last = i;
cycles.push_back();
while (!vis[pos]) {
vis[pos] = true;
cycles.back().push_back(pos);
ans += abs(p[pos] - pos);
pos = p[pos];
}
}
ans += last;
return ans;
}