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;
const int N=1e6;
int vis[N], n;
long long minimum_walk(vector<int> p, int s) {
n=p.size();
vector<int> v;
long long ans=0;
int mx=0;
for (int i=0; i<n; ++i) if (!vis[i]){
int cur=n;
while (!vis[i]){
cur=min(cur, i);
vis[i]=1;
ans+=abs(p[i]-i);
i=p[i];
}
mx+=cur;
}
return ans+mx*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... |