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(std::vector<int> p, int s) {
long long int sum=0;
int n=p.size();
int vis[n];
for(int i=0;i<n;i++){
vis[i]=0;
}
long long int sad=0;
for(int i=0;i<n;i++){
if(vis[i]==0 and i!=p[i]){
sad=i;
int i1=i;
int t1=0;
long long int iduci=p[i];
long long int tren=i;
while(t1==0){
sum=sum+abs(iduci-tren);
vis[tren]++;
tren=iduci;
iduci=p[tren];
if(tren==i1){
break;
}
}
}
}
sum=sum+2*sad;
return sum;
}
# | 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... |