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 long long ll;
long long minimum_walk(vector<int> p, int s){
int n=p.size();
ll ans=0;
int pos=s;
for(int i=0;i<n;i++){
int cur=p[i];
if(cur==i)continue;
while(cur!=i){
ans+=abs(cur-pos);
pos=cur;
swap(cur,p[cur]);
}
ans+=abs(pos-i);
pos=i;
}
ans+=abs(pos-s);
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... |