Submission #1217019

#TimeUsernameProblemLanguageResultExecution timeMemory
1217019takoshanavaBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int pos[]) { vector<int> a(pos, pos + N); const long long INF = LLONG_MAX/4; vector<long long> dp1(N+1, INF), dp2(N+1, INF); dp1[0] = 0; for (int i = 1; i <= N; i++) { dp1[i] = dp1[i-1] + 2LL * a[i-1]; if (i >= K) { dp1[i] = min(dp1[i], dp1[i-K] + 2LL * a[i-1]); } } dp2[0] = 0; for (int i = 1; i <= N; i++) { long long d = L - a[N - i]; dp2[i] = dp2[i-1] + 2LL * d; if (i >= K) { dp2[i] = min(dp2[i], dp2[i-K] + 2LL * d); } } long long ans = INF; for (int i = 0; i <= N; i++) { ans = min(ans, dp1[i] + dp2[N - 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...
#Verdict Execution timeMemoryGrader output
Fetching results...