제출 #725764

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725764		becaido	선물상자 (IOI15_boxes)	C++17	0 / 100	1 ms	340 KiB

boxes

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;

#ifndef WAIMAI
#include "boxes.h"
#endif

#ifdef WAIMAI
#define debug(HEHE...) cout << "[" << #HEHE << "] : ", dout(HEHE)
void dout() {
    cout << '\n';
}
template<typename T, typename...U>
void dout (T t, U...u) {
    cout << t << (sizeof... (u) ? ", " : ""), dout (u...);
}
#else
#define debug(...) 7122
#endif

#define ll long long
#define Waimai ios::sync_with_stdio(false), cin.tie(0)
#define FOR(x,a,b) for (int x = a, I = b; x <= I; x++)
#define pb emplace_back
#define F first
#define S second

const int SIZE = 1e7 + 5;

ll L[SIZE], R[SIZE];

ll delivery (int n, int k, int len, int a[]) {
    FOR (i, 0, n - 1) L[i] = (i >= k ? L[i - k] : 0) + min(2 * a[i], len);
    for (int i = n - 1; i >= 0; i--) R[i] = (i+k-1 < n ? R[i+k-1] : 0) + min(2 * (len-a[i]), len);
    ll ans = min(L[n - 1], R[0]);
    FOR (i, 0, n - 2) ans = min(ans, L[i] + R[i + 1]);
    return ans;
}

#ifdef WAIMAI
int main() {
    int N, K, L, i;
    cin >> N >> K >> L;
    int *p = (int*) malloc (sizeof (int) * (unsigned int) N);
    for (i = 0; i < N; i++) cin >> p[i];
    cout << delivery (N, K, L, p) << '\n';
}
#endif

/*
in1
3 2 8
1 2 5
out1
10
*/

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