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>
int n;bool used[1009];
long long minimum_walk(std::vector<int> p, int s) {
n=p.size();
int sum=0,L=0;
for(int i=0;i<n;i++){
if(used[i]==true) continue;
int cx=i;L=i;
while(true){
sum+=abs(cx-p[cx]);used[cx]=true;
cx=p[cx];if(cx==i) break;
}
}
return sum+L*2;
}
# | 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... |