Submission #403999

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