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;
long long minimum_walk(vector<int> p, int s) {
int n = p.size();
vector<bool> visited(n, 0);
vector<vector<int>> cycles;
long long ans = 0;
for(int i = 0; i<n; i++) ans += abs(p[i]-i);
for(int i = 0; i<n; i++){
if(visited[i]) continue;
cycles.push_back({});
int j = i;
while(!visited[j]){
visited[j] = 1;
cycles.back().push_back(j);
j = p[j];
}
}
int leftMost = 0;
for(auto x : cycles){
int mi = n;
for(auto y : x) mi = min(mi, y);
leftMost = max(leftMost, mi);
}
return ans+2ll*leftMost;
}
# | 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... |