# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
526863 | KoD | 고대 책들 (IOI17_books) | C++17 | 101 ms | 22996 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 std::vector;
using std::array;
using std::pair;
using std::tuple;
using ll = long long;
ll minimum_walk(vector<int> P, int src) {
{
int l = 0;
while (l < src and P[l] == l) {
l += 1;
}
int r = (int)P.size() - 1;
while (r > src and P[r] == r) {
r -= 1;
}
src -= l;
P.erase(P.begin() + r + 1, P.end());
P.erase(P.begin(), P.begin() + l);
}
const int N = P.size();
assert(N <= 1000);
vector<int> min(N), max(N);
vector<char> done(N);
ll ret = 0;
for (int i = 0; i < N; ++i) {
# | 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... |