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 <cassert>
#include <algorithm>
#define long long long
using namespace std;
long minimum_walk(std::vector<int> p, int s) {
assert(s == 0);
int n = p.size();
while (n > 0 && p[n - 1] == n - 1) --n;
int mx = 0; long ans = 0;
for (int i = 0; i < n; ++i)
{
if (i > 0 && mx < i) ans += 2;
mx = max(mx, p[i]);
ans += abs(i - p[i]);
}
return ans;
}
# | 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... |