제출 #434260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
434260		Tangent	선물상자 (IOI15_boxes)	C++17	100 / 100	769 ms	324436 KiB

boxes

#include "boxes.h"
#include "bits/stdc++.h"
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
 
#define ffor(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define fford(i, a, b) for (ll i = (a); i > (ll)(b); i--)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()

long long delivery(int N, int K, int L, int p[]) {
    vll left = {0}, right = {0};
    rep(i, N) {
        if (i < K) {
            left.emplace_back(min(2 * p[i], L));
        } else {
            left.emplace_back(left[i - K + 1] + min(2 * p[i], L));
        }
    }
    rep(i, N) {
        if (i < K) {
            right.emplace_back(min(2 * (L - p[N - i - 1]), L));
        } else {
            right.emplace_back(right[i - K + 1] + min(2 * (L - p[N - i - 1]), L));
        } 
    }
    ll res = left[N];
    rep(i, N) {
        res = min(res, left[i] + right[N - i]);
    }
    return res;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 15 / 15
• Subtask 4: 15 / 15
• Subtask 5: 20 / 20
• Subtask 6: 30 / 30