# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290444 | A02 | Ancient Books (IOI17_books) | C++14 | 163 ms | 19200 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 <bits/stdc++.h>
#include "books.h"
using namespace std;
long long minimum_walk(vector<int> p, int s) {
vector<int> np;
long long book_total = 0;
int left_start = p.size();
int right_start = 0;
for (int i = 0; i < p.size(); i++){
if (p[i] != i){
left_start = min(left_start, i);
}
}
for (int i = p.size() - 1; i >= 0; i--){
if (p[i] != i){
right_start = max(right_start, i);
}
}
if (left_start == p.size()){
return 0;
}
if (s < left_start){
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... |