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 vis[1000001];
long long minimum_walk(vector <int> p, int s){
int x=0,n=p.size();
long long d=0;
for (int i=0;i<n;i++){
if (!vis[i]){
x=i;
while (true){
vis[x]=1;
d+=abs(x-p[x]);
x=p[x];
if (x==i)
break;
}
}
}
return x*2+d;
}
# | 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... |