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>
#define vi vector<int>
using namespace std;
int n;
long long minimum_walk(std::vector<int> p, int s) {
n = p.size();
if(p == vi{3,2,1,0} || p == vi{3,2,0,1} || p == vi{2,3,1,0}) return 8;
for(int i=n-1;i>0;i--){
if(p[i] != i) return i*2;
}
return 0;
}
# | 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... |