#include <bits/stdc++.h>
#include "books.h"
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
using namespace std;
typedef long long ll;
const int maxN = 1e6 + 10;
bool mark[maxN];
vector <pii> que;
long long minimum_walk(std::vector<int> p, int s) {
int n = p.size();
ll ans = 0;
for (int i=0; i<n; i++)
{
if(mark[i]) continue ;
int curr = i, mn = n, sz = 0, mx = 0;
while(!mark[curr])
{
mn = min(mn, curr);
mx = max(mx, curr);
sz ++;
mark[curr] = true;
ans += abs(p[curr] - curr);
curr = p[curr];
}
que.pb({mn, mx});
}
sort(que.begin(), que.end());
int len = que.size();
int maxR = 0, currL = 0;
vector <pii> res;
for (int i=0; i<len; i++)
{
if(maxR >= que[i].F) maxR = max(maxR, que[i].S);
else
{
res.pb({currL, maxR});
currL = maxR + 1;
maxR = que[i].S;
}
}
res.pb({currL, maxR});
int M = -1, m = -1, mid = -1;
for (int i=0; i<(int)res.size(); i++){
if(res[i].F <= s && s <= res[i].S) mid = i;
if(res[i].F == res[i].S) continue ;
if(res[i].S < s && m == -1) m = i;
if(res[i].F > s) M = i;
}
if(m == -1) m = mid;
if(M == -1) M = mid;
return ans + 2LL * (M - m);
}
