제출 #1158622

#제출 시각아이디문제언어결과실행 시간메모리
1158622SharkyAncient Books (IOI17_books)C++20
0 / 100
0 ms328 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; long long minimum_walk(std::vector<int> p, int s) { int f = 0, n = p.size(); for (int i = 0; i < n; i++) { if (p[i] == i) f++; else break; } long long ans = 0; for (int i = 0; i < n; i++) ans += abs(p[i] - i); return ans + f * 2; }
#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...