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 namespace std;
int n, a[1000100];
long long minimum_walk(std::vector<int> p, int s) {
    n = p.size();
    long long ans = 0;
    for (int i = 1; i <= n; i++){
        int l = p[i-1]+1, r = i;
        ans += abs(l-r);
        if (l > r)
            swap(l, r);
        ++a[l];
        --a[r];
    }
    int sz = 0;
    for (int i = 1; i <= n; i++){
        a[i] += a[i-1];
        if (a[i]){
            ans += sz;
            sz = 0;
        } else
            sz += 2;
    }
    return ans;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |