# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
708109 | Cyanmond | 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 "books.h"
#include <bits/stdc++.h>
using i64 = long long;
void chmax(i64 &a, i64 b) {
if (a < b) a = b;
}
long long minimum_walk(std::vector<int> p, int s) {
const int n = (int)p.size();
std::vector<std::vector<int>> cycles;
std::vector<i64> cycleCost;
std::vector<bool> used(n);
for (int i = 0; i < n; ++i) {
if (used[i]) continue;
int now = i;
std::vector<int> cycle;
i64 cost = 0;
do {
cycle.push_back(now);
used[now] = true;
const int nx = p[now];
cost += std::abs(nx - now);
now = nx;
} while (now != i);
if (cycle.size() == 1) {
continue;
}
cycles.push_back(std::move(cycle));
cycleCost.push_back(cost);
}
const int M = (int)cycles.size();
i64 x = 0;
for (const auto &vec : cycles) {
chmax(x, *std::min_element(vec.begin(), vec.end()));
}
const i64 costSum = std::accumulate(cycleCost.begin(), cycleCost.end(), 0ll);
return costSum + 2 * x;
}
using namespace std;
int main() {
int n, s;
assert(2 == scanf("%d %d", &n, &s));
vector<int> p((unsigned)n);
for (int i = 0; i < n; i++) assert(1 == scanf("%d", &p[(unsigned)i]));
long long res = minimum_walk(p, s);
printf("%lld\n", res);
return 0;
}