제출 #974817

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
974817		marinaluca	선물상자 (IOI15_boxes)	C++14	10 / 100	2 ms	2648 KiB

boxes

#include <bits/stdc++.h>
#pragma GCC optimize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")

using namespace std;
//#define int long long
#define ll long long
#define xx first
#define yy second
#define all (x) begin(x), end(x)
#define FOR (i, a, b) for (auto i = (a); i < (b); ++ i)

const int NMAX = 1e7;
int ans[NMAX + 1], rez[NMAX + 1];
int delivery (int n, int k, int l, int s[]){
    for (int i = 1; i <= n; ++ i){
        ans[i] = min (s[i - 1] * 2 , l);
        if (i > k){
            ans[i] += ans[i - k];
        }
    }
    int mini = ans[n];
    for (int i = n - 1; i >= 0; -- i){
        rez[i] = min ((l - s[i]) * 2, l);
        if (i < n - k){
            rez[i] += rez[i + k];
        }
        mini = min (mini, rez[i] + ans[i]);
    }
    return mini;
}

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