#include "books.h"
#include<bits/stdc++.h>
using namespace std;
int n, minl, maxr;
vector<int> pref, f1, f2;
vector<pair<int, int>> cyc;
pair<int, int> getrange(int l, int r) {
int lv, rv;
lv = min(l, min(cyc[l].first, cyc[r].first));
rv = max(r, max(cyc[l].second, cyc[r].second));
while(lv < l || r < rv) {
if (lv < l) {
l--;
lv = min(lv, cyc[l].first);
rv = max(rv, cyc[l].second);
} else {
r++;
lv = min(lv, cyc[r].first);
rv = max(rv, cyc[r].second);
}
}
return {l, r};
}
long long minimum_walk(vector<int> p, int s) {
long long int ans = 0;
n = p.size();
pref.resize(n+1, 0);
f1.resize(n, 0);
f2.resize(n, 0);
cyc.resize(n);
minl = INT_MAX;
maxr = 0;
for (int i = 0; i < n; i++) {
ans += abs(i-p[i]);
}
vector<pair<int, int>> cycles;
vector<int> vis(n, 0);
for (int i = 0; i < n; i++) {
if (p[i] == i) {
cyc[i] = {i, i};
continue;
}
if (vis[i]) {
continue;
}
int a = i, l = i, r = i;
vis[i] = 1;
a = p[i];
vis[a] = 1;
l = min(l, a);
r = max(r, a);
while(a != i) {
a = p[a];
vis[a] = 1;
l = min(l, a);
r = max(r, a);
}
a = p[a];
cyc[a] = {l, r};
while(a != i) {
a = p[a];
cyc[a] = {l, r};
}
minl = min(minl, l);
maxr = max(maxr, r);
cycles.push_back({min(l, r), max(l, r)});
}
for (auto [i, j] : cycles) {
pref[i] += 1;
pref[j] -= 1;
}
for (int i = 1; i < n; i++) {
pref[i] += pref[i-1];
}
if (s == 0) {
for (int i = n-1; i >= 0; i--) {
if (pref[i] > 0) {
f2[i] = 1;
}
if (i < n-1) {
f2[i] |= f2[i+1];
}
}
for (int i = n-1; i >= 0; i--) {
if (f2[i] && pref[i] == 0) {
ans += 2;
}
}
} else {
int l = s, r = s;
pair<int, int> ra;
ra = getrange(l, r);
l = ra.first;
r = ra.second;
while(minl < l || r < maxr) {
bool f1 = 0, f2 = 0;
int dp1 = 0, dp2 = 0, lv1 = l, rv1 = r, lv2 = l, rv2 = r;
while(minl < lv1) {
lv1--;
ra = getrange(lv1, rv1);
lv1 = ra.first;
rv1 = ra.second;
dp1 += 2;
if (rv1 > r) {
f1 = 1;
break;
}
}
while(rv2 < maxr) {
rv2++;
ra = getrange(lv2, rv2);
lv2 = ra.first;
rv2 = ra.second;
dp2 += 2;
if (lv2 < l) {
f2 = 1;
break;
}
}
if (f1 && f2) {
ans += min(dp1, dp2);
} else {
ans += dp1+dp2;
}
l = min(lv1, lv2);
r = max(rv1, rv2);
}
}
return ans;
}
