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;
#define PB push_back
#define MP make_pair
typedef long long ll;
long long minimum_walk(vector<int> p, int s) {
int jumbco=0;
int lastjumb=0;
int n=p.size();
bool isswap=false;
for(int i=0;i<n;i++){
if(p[p[i]]==i)isswap=true;
if(p[i]!=i){
jumbco++;
lastjumb=i;
}
}
if(jumbco==4){
if((p[2]==1 && p[1]==3)||(p[1]==2 && p[2]==0)||isswap)return 8;
else return 6;
}
return lastjumb*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... |