Submission #54700

#TimeUsernameProblemLanguageResultExecution timeMemory
54700fallingstarAncient Books (IOI17_books)C++14
0 / 100
2 ms720 KiB
#include <cassert> #include <iostream> #include <algorithm> #include <vector> #define long long long using namespace std; long minimum_walk(vector<int> p, int s) { int n = p.size(); assert(s == 0); 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...