# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58216 | ruhanhabib39 | Ancient Books (IOI17_books) | C++17 | 209 ms | 103148 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 <vector>
#include <cstdlib>
#include <algorithm>
#include "books.h"
long long minimum_walk(std::vector<int> p, int s) {
if(s) return 0;
while(p.size() && p.back() == p.size()-1) p.pop_back();
long long res = 0;
for(int i = 0; i < (int)p.size(); i++) {
res += abs(p[i] - i);
}
int r = 0;
for(int i = 0; i < (int)p.size()-1; i++) {
r = std::max(r, p[i]);
if(i == r) 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... |