# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780567 | 2023-07-12T10:20:00 Z | CSQ31 | Ancient Books (IOI17_books) | C++17 | 0 ms | 0 KB |
#include "books.cpp" #include <cstdio> #include <vector> #include <cassert> using namespace std; int main() { int n, s; assert(2 == scanf("%d %d", &n, &s)); vector<int> p((unsigned) n); for(int i = 0; i < n; i++) assert(1 == scanf("%d", &p[(unsigned) i])); long long res = minimum_walk(p, s); printf("%lld\n", res); return 0; }