제출 #55686

#제출 시각아이디문제언어결과실행 시간메모리
55686minkank고대 책들 (IOI17_books)C++17
0 / 100
3 ms528 KiB
#include <bits/stdc++.h> #include "books.h" using namespace std; long long minimum_walk(vector<int> a, int s) { int n = a.size(); while(n >= 0 && a[n] == n) n--; long long ans = 0; for(int i = 0; i < n; ++i) ans += abs(i - a[i]); int R = 0; for(int i = 0; i < n - 1; ++i) { R = max(R, a[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...