#include "books.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define ffor(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define fford(i, a, b) for (ll i = (a); i > (ll)(b); i--)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()
long long minimum_walk(std::vector<int> p, int s) {
int n = p.size();
vii seen(n);
vpii segs;
ll res = 0;
rep(i, n) {
if (!seen[i]) {
seen[i] = true;
int lo = i, hi = i;
res += abs(p[i] - i);
int curr = p[i];
while (curr != i) {
lo = min(lo, curr);
hi = max(hi, curr);
seen[curr] = true;
res += abs(curr - p[curr]);
curr = p[curr];
}
if (lo != hi)
segs.emplace_back(lo, hi);
}
}
sort(all(segs));
reverse(all(segs));
if (segs.empty()) return res;
vpii merged = {segs.back()};
segs.pop_back();
while (!segs.empty()) {
if (segs.back().first <= merged.back().second) {
merged.back().second = max(merged.back().second, segs.back().second);
} else {
merged.emplace_back(segs.back());
}
segs.pop_back();
}
rep(i, merged.size() - 1) {
res += (merged[i + 1].first - merged[i].second) * 2;
}
if (s < merged[0].first) {
res += 2 * (merged[0].first - s);
}
if (s > merged.back().second) {
res += 2 * (s - merged.back().second);
}
forin(seg, merged) {
if (seg.first < s && s < seg.second) {
rep(i, n) {
if (p[s + i] != s + i || p[s - i] != s - i) {
res += 2 * i;
break;
}
}
}
}
return res;
}
