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;
typedef vector<int> vi;
int n;
int s;
int l = 0;
int h = -1;
vi a;
int bst = INT_MAX;
bool correct()
{
    bool r = true;
    for (int i = 0; i < n; i++)
        if (a[i] != i)
            r = false;
    return r;
}
void bk(int p, int d)
{
    //cout << d << endl;
    if (p == s && correct()) {
        bst = min(bst, l);
        return;
    }
    swap(h, a[p]);
    if (p == s && correct()) {
        bst = min(bst, l);
        return;
    }
    swap(h, a[p]);
    if (l >= bst || d >= 15)
        return;
    for (int i = 0; i < n; i++) {
        if (i == p)
            continue;
        l += abs(p - i);
        swap(h, a[p]);
        bk(i, d + 1);
        swap(h, a[p]);
        bk(i, d + 1);
        l -= abs(p - i);
    }
}
long long minimum_walk(vector<int> p, int s_)
{
    //cout << "HELLO" << endl;
    n = p.size();
    s = s_;
    for (int x : p)
        a.push_back(x);
    bk(s, 0);
    return bst;
}
| # | 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... |