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(vector<int> p, int s) {
int n = (int)p.size();
vector<int> rev(n);
long long ans = 0;
for(int i = 0; i < n; ++i)
rev[p[i]] = i;
int mx = 0;
for(int i = 0; i < n; ++i){
if(p[i] != i){
if(i > mx)
ans += (i - mx) * 2;
int v = i;
do{
ans += abs(p[v] - v);
mx= max(mx, v);
int prev = v;
v = p[v];
p[prev] = prev;
}
while(v != i);
}
}
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... |