제출 #1061318

#제출 시각아이디문제언어결과실행 시간메모리
1061318fv3고대 책들 (IOI17_books)C++14
12 / 100
0 ms600 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; ll minimum_walk(vector<int> P, int S) { const int N = P.size(); ll res = 0; for (int i = 0; i < N; i++) { res += abs(P[i] - i); } int sort_length = 0; while (sort_length < N && P[sort_length] == sort_length) sort_length++; if (sort_length < N) res += sort_length * 2; return res; }
#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...