# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
71804 | nirshalmon | Ancient Books (IOI17_books) | C++14 | 237 ms | 12876 KiB |
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;
long long minimum_walk(std::vector<int> p, int s) {
long long base = -2;
int mx = -1;
int f = 0, l = p.size() - 1;
for (; f < p.size(); ++f) {
if (p[f] != f) break;
}
for (; l >= 0; --l) {
if (p[l] != l) break;
}
if (l == -1) return 0;
for (int i = f; i <= l; ++i) {
base += abs(p[i] - i);
mx = max(p[i], mx);
if (mx <= i)
base += 2;
}
if (s < f) base += 2 * (f - s);
if (s > l) base += 2 * (s - l);
return base;
}
Compilation message (stderr)
# | 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... |