Submission #54706

#TimeUsernameProblemLanguageResultExecution timeMemory
54706fallingstarAncient Books (IOI17_books)C++14
50 / 100
202 ms103112 KiB
#include "books.h" #include <cassert> #include <algorithm> #define long long long using namespace std; long minimum_walk(std::vector<int> p, int s) { assert(s == 0); int n = p.size(); while (n > 0 && p[n - 1] == n - 1) --n; int mx = 0; long ans = 0; for (int i = 0; i < n; ++i) { if (i > 0 && mx < i) ans += 2; mx = max(mx, p[i]); ans += abs(i - p[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...