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;
#define F first
#define S second
long long minimum_walk(vector<int> p, int s){
int n=p.size(), r=0, x=0, y=0;
bool b[n];
for(int i=0; i<n; i++)b[i]=0;
for(int i=0; i<n; i++){
if(!b[i]&&p[i]!=i){
r+=2*(i-x);
x=i;
r+=p[i]-i;
y=p[i];
while(y!=i){
b[y]=1;
r+=abs(p[y]-y);
y=p[y];
}
b[y]=1;
}
}
return r;
}
# | 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... |