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;
int ptr = 0;
vector<int> cycle;
vector<int> p;
int n;
ll total = 0;
void findcycle(int i){
total += abs(i-p[i]);
cycle[i] = ptr;
if (cycle[p[i]]!=-1){return;}
findcycle(p[i]);
}
ll minimum_walk(std::vector<int> px, int s) {
p = px;
n = p.size();
cycle.resize(n,-1);
int minind = -1;
for (int i = 0; i<n; i++){
if (cycle[i]!=-1){continue;}
minind=i;
findcycle(i);
ptr++;
}
return total+2*minind;
}
# | 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... |