제출 #791959

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;


#define int int64_t


long long delivery(signed N, signed K, signed L, signed p[]) {

    vector<int> left, right;

    for (int i = 0; i<N; i++) {
        if (p[i] < L/2) left.push_back(p[i]);
        else right.push_back(L-p[i]);
    }

    sort(left.begin(), left.end());
    sort(right.begin(), right.end());

    auto leftO = left;
    auto rightO = right;

    long long res1 = L;
    
    for (int i = 0; i<K; i++) {
        if ((left.size() && right.empty()) || (left.size() && left.back() > right.back())) {
            left.pop_back();
        } else if (right.size()) {
            right.pop_back();
        }
    }

    while (left.size()) {
        res1 += left.back()*2;
        for (int i = 0; i<K; i++) {
            if (left.size()) left.pop_back();
        }
    }
    while (right.size()) {
        res1 += right.back()*2;
        for (int i = 0; i<K; i++) {
            if (right.size()) right.pop_back();
        }
    }


    left = leftO;
    right = rightO;


    long long res2 = 0;
    
    while (left.size()) {
        res2 += left.back()*2;
        for (int i = 0; i<K; i++) {
            if (left.size()) left.pop_back();
        }
    }
    while (right.size()) {
        res2 += right.back()*2;
        for (int i = 0; i<K; i++) {
            if (right.size()) right.pop_back();
        }
    }


    return min(res1, res2);

}

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