제출 #336698

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
336698		Vladth11	선물상자 (IOI15_boxes)	C++14	70 / 100	514 ms	192768 KiB

boxes

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debug_with_space(x) cerr << #x << " " << x << " "
#include "boxes.h"

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <ll, pii> piii;
typedef tree <pii, null_type, less <pii>, rb_tree_tag, tree_order_statistics_node_update> OST;

const ll NMAX = 1000001;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 101;
const ll nr_of_bits = 35;

ll s1[NMAX], s2[NMAX];

ll delivery(int N, int K, int L, int p[]){
    for(int i = 1; i <= N; i++){
        if(i >= K){
            s1[i] = s1[i - K] + min(p[i - 1] * 2, L);
        }else{
            s1[i] = min(p[i - 1] * 2, L);
        }
    }
    for(int i = N; i >= 1; i--){
        if(i <= N - K + 1){
            s2[i] = s2[i + K] + min((L - p[i - 1]) * 2, L);
        }else{
            s2[i] = min((L - p[i - 1]) * 2, L);
        }
    }
    ll maxim = INF;
    for(int i = 0; i <= N; i++){
        maxim = min(maxim, s1[i] + s2[i + 1]);
    }
    return maxim;
}

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