Submission #1217055

#TimeUsernameProblemLanguageResultExecution timeMemory
1217055takoshanavaBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; const int MAX = 10000005; long long dp1[MAX], dp2[MAX]; long long delivery(int N, int K, int L, int pos[]) { for(int i = 0; i < N; i++){ dp1[i] = dp1[max(0, i - K)] + pos[i] + min(pos[i], (L - pos[i])); } for(int i = N - 1; i >= 0; i--){ dp2[i] = dp2[min(N, i + K)] + (L - pos[i]) + min(pos[i], (L - pos[i])); } long long ans = 1e18; for(int i = 0; i <= N - 1; i++){ ans = min(ans, dp1[i] + dp2[i + 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...