Submission #55683

#TimeUsernameProblemLanguageResultExecution timeMemory
55683minkankAncient Books (IOI17_books)C++17
0 / 100
2 ms608 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; long long minimum_walk(vector<int> p, int s) { int n = p.size(); int R = p[0]; long long ans = 0; for(int i = 0; i < n; ++i) ans += abs(i - p[i]); for(int i = 1; i < n; ++i) { R = max(R, p[i]); if(i == R) ans += 2; } 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...