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>
#include "books.h"
template <class T>
using Vec = std::vector<T>;
long long minimum_walk(Vec<int> p, int s) {
assert(s == 0);
const int n = (int) p.size();
Vec<bool> done(n);
long long ret = 0;
int max = 0;
for (int i = 0; i < n; ++i) {
ret += std::abs(p[i] - i);
if (!done[i]) {
max = std::max(max, i);
int u = i;
while (!done[u]) {
done[u] = true;
u = p[u];
}
}
}
return ret + 2 * max;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |