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 <bits/stdc++.h>
#include "books.h"
using namespace std;
long long minimum_walk(vector<int> p, int s) {
long long book_total = 0;
int n = p.size();
for (int i = 0; i < n; i++){
book_total += max(p[i] - i, i - p[i]);
}
if (s == 0){
int current_region_max = 0;
for (int i = 0; i < n; i++){
if (current_region_max < i){
book_total += 2;
}
current_region_max = max(current_region_max, i);
current_region_max = max(current_region_max, p[i]);
}
}
return book_total;
}
# | 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... |