제출 #959845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
959845		hariaakas646	선물상자 (IOI15_boxes)	C++14	100 / 100	682 ms	294036 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;



long long delivery(int n, int k, int l, int pos[]) {
    vll dp1(n+1), dp2(n+2);
    sort(pos, pos+n);
    forr(i, 1, n+1) {
        dp1[i] = dp1[max(0, i-k)] + min(pos[i-1]*2, l);
    }

    for(int i=n; i>=1; i--) {
        dp2[i] = dp2[min(n+1, i+k)] + min((l-pos[i-1]) * 2, l);
    }

    lli mi = 1e18;
    frange(i, n+1) {
        mi = min(mi, dp1[i] + dp2[i+1]);
    }
    return mi;
}

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