#include "books.h"
#include <bits/stdc++.h>
using namespace std;
#define bug(x) cout << #x << " " << x << endl;
#define ll long long
const int maxn = 1e6 + 10;
bool marc[maxn];
long long minimum_walk(vector<int> p, int s) {
if( is_sorted( p.begin(), p.end() ) ) return 0;
int n = (int)p.size();
ll resp = 0;
for( int i = 0; i < (int)p.size(); i++ ) resp += abs(p[i] - i);
int maxi = -1;
bool contido = false;
for( int i = 0; i < n; i++ ){
if( !marc[i] && p[i] != i ){
if( maxi != -1 && i > maxi ) resp += 2*(i - maxi);
int cur = i;
while( !marc[cur] ){
maxi = max( maxi, cur );
marc[cur] = true;
cur = p[cur];
}
if( i <= s && s <= maxi ) contido = true;
}
}
int l = s, r = s;
while( l >= 0 && !marc[l] ) l--;
while( r < n && !marc[r] ) r++;
if( contido ) resp += 2LL*min( s - l, r - s );
else{
if( l == -1 ) resp += 2LL*(r - s);
else if( r == n ) resp += 2LL*(s - l);
}
return resp;
}
