제출 #431564

#제출 시각아이디문제언어결과실행 시간메모리
431564rainboy고대 책들 (IOI17_books)C++98
50 / 100
181 ms18772 KiB
#include "books.h" using namespace std; const int N = 1000000; typedef vector<int> vi; int dd[N]; long long minimum_walk(vi pp, int s) { int n = pp.size(), i; long long ans; ans = 0; for (i = 0; i < n; i++) if (i < pp[i]) ans += pp[i] - i, dd[i]++, dd[pp[i]]--; else if (i > pp[i]) ans += i - pp[i], dd[pp[i]]++, dd[i]--; for (i = 1; i < n - 1; i++) dd[i] += dd[i - 1]; i = n - 1; while (i >= 0 && pp[i] == i) i--; for (i--; i >= 0; i--) if (dd[i] == 0) 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...