# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
821193 | vjudge1 | Ancient Books (IOI17_books) | C++17 | 90 ms | 12036 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 res = 0;
vector<int> pre(p.size(), 0);
for (int i = 0; i < p.size(); i++) {
res += abs(i - p[i]);
int l = min(i, p[i]);
int r = max(i, p[i]);
pre[l]++;
pre[r]--;
}
int last = p.size() - 1;
while (last > s && p[last] == last) {
last--;
}
int first = 0;
while (first < s && p[first] == first) {
first++;
}
for (int i = 0; i < last; i++) {
pre[i + 1] += pre[i];
}
for (int i = first; i < last; i++) {
if (pre[i] == 0) {
res += 2;
}
}
return res;
}
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... |