# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363587 | Sparky_09 | 선물상자 (IOI15_boxes) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
void usaco(string s){
freopen((s+".in").c_str(), "r", stdin);
freopen((s+".out").c_str(), "w", stdout);
}
int delivery(int n, int k, int l, int pos[]){
vector<int> pre(n+2, 0), suf(n+2, 0);
for(int i = 1; i <= n; i++){
pre[i] = min(pre[i-k>=0?i-k:0] + 2 * pos[i-1], l);
suf[i] = min(suf[i-k>=0?i-k:0] + 2 * (l - pos[n-i]), l);
}
int ans = MAX_INT;
for(int i = 0; i <= n; i++){
ans = min(ans, pre[i] + suf[n-i]);
}
return ans;
}