제출 #216000

#제출 시각아이디문제언어결과실행 시간메모리
216000emil_physmath고대 책들 (IOI17_books)C++17
0 / 100
5 ms256 KiB
#include "books.h" #include <vector> #include <cmath> using namespace std; long long minimum_walk(vector<int> a, int s) { int n = a.size(); long long ans = 0; vector<bool> used(n); for (int i = 0; i < n; ++i) { if (!used[i]) { ans = max(ans, 2LL * i); int j = i; do { used[j] = true; j = a[j]; } while(j != i); } } for (int i = 0; i < n; ++i) ans += abs(a[i] - i); 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...