Submission #522597

#TimeUsernameProblemLanguageResultExecution timeMemory
522597cig32Boxes with souvenirs (IOI15_boxes)C++17
0 / 100
1 ms300 KiB
#include <bits/stdc++.h> using namespace std; #include "boxes.h" #define int long long long long delivery(int32_t n, int32_t k, int32_t l, int32_t p[]) { int L[n+1], R[n+1], ans = 1e18; for(int i=0; i<=n; i++) L[i] = R[i] = 1e18; L[0] = R[n] = 0; for(int i=1; i<=n; i++) { L[i] = L[max(i-k, 0ll)] + 2 * p[i-1], R[n-i] = R[min(n-i+k, (int)n)] - 2 * p[n-i] + 2 * l; } for(int i=0; i<=n; i++) ans = min(ans, L[i] + min(R[i], R[min(i+k, (int)n)] + 1)); 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...