Submission #1218006

#TimeUsernameProblemLanguageResultExecution timeMemory
1218006viduxBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
0 ms468 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll, ll> pll; typedef vector<ll> vl; const ll LLINF = 1e18; long long delivery(int n, int k, int l, int a[]) { vl tr(n+1); for (int i = n-1; i >= 0; i--) { tr[i] = tr[min(n, i+k)]+(l-a[i])+min(a[i], l-a[i]); } ll ans = LLINF; vl tl(n+1); for (int i = 0; i <= n; i++) { if (i<n) tl[i+1] = tl[max(0, i-k)]+a[i]+min(a[i], l-a[i]); ans = min(ans, tl[i]+tr[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...