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;
int n;bool used[1000009];
long long minimum_walk(vector<int> p, int s) {
n=p.size();
long long sum=0,L=(1LL<<60);
for(int i=0;i<n;i++){
if(used[i]==true || i==p[i]) continue;
int cx=i;L=min(L,1LL*i);
while(true){
sum+=abs(cx-p[cx]);used[cx]=true;
cx=p[cx];if(cx==i) break;
}
}
if(L==(1LL<<60)) L=0;
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... |