Submission #404000

#TimeUsernameProblemLanguageResultExecution timeMemory
404000b00n0rpAncient Books (IOI17_books)C++17
50 / 100
124 ms15064 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; int last = n; for(int i = 0; i < n; i ++){ ans += abs(i-p[i]); mx = max(p[i],mx); if(i == mx) ans += 2; if(i == p[i]) last = min(last,i); else last = n; } last = max(last,1); return ans-2*(n-last); }
#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...