# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132311 | MoNsTeR_CuBe | Ancient Books (IOI17_books) | C++17 | 0 ms | 0 KiB |
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 <bits/stdc++.h>
//#include "books.h"
using namespace std;
long long minimum_walk(std::vector<int> p, int s) {
#define int long long
vector< pair<int, int> > v;
for(int i = 0; i < (int)p.size(); i++){
v.push_back(make_pair(p[i], i));
}
sort(v.begin(), v.end());
int last = s;
int tot = 0;
for(int i = 0; i < (int)v.size(); i++){
tot += abs(last - v[i].second);
tot += abs(v[i].first-v[i].second);
last = v[i].first;
}
tot += abs(last - s);
return tot;
#undef int
}
int main(){
int n, s;
cin >> n >> s;
vector< int > p(n);
for(int i = 0; i < n; i++){
cin >> p[i];
}
cout << minimum_walk(p,s) << endl;
}