제출 #996499

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
996499		Alfraganus	선물상자 (IOI15_boxes)	C++17	15 / 100	2 ms	348 KiB

boxes

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

#define ll long long

ll delivery(int n, int k, int l, int p[]) {
    sort(p, p + n);
    ll ans = 1e18;
    auto get = [&](ll x){return min(x, l - x);};
    vector<int> q;
    for(int i = 0; i < n; i ++)
        if(p[i] != 0)
            q.push_back(p[i]);
    n = (int)q.size();
    for(int i = 0; i < (1 << n); i ++){
        // cout << i << endl;
        ll mx = 0;
        deque<int> dq;
        for(int j = 0; j < n; j ++){
            if(i & (1 << j)){

                dq.push_back(q[j]);
            }
        }
        // for(auto x : dq)
        //     cout << x << ' ';
        // cout << endl;
        while(dq.size() > 0){
            int sz = (int)dq.size();
            ll clock = dq.back() + get(dq.back());
            mx += clock;
            for(int j = 0; j < min(sz, k); j ++)
                dq.pop_back();
        }
        for(int j = 0; j < n; j ++){
            if((i & (1 << j)) == 0){
                dq.push_back(q[j]);
            }
        }
        // for(auto x : dq)
        //     cout << x << ' ';
        // cout << endl;
        while(dq.size() > 0){
            int sz = (int)dq.size();
            ll clock = l - dq.front() + get(dq.front());
            mx += clock;
            for(int j = 0; j < min(sz, k); j ++)
                dq.pop_front();
        }
        // cout << mx << endl;
        ans = min(ans, mx);
    }
    return ans;
    for(int i = 0; i <= n; i ++){
        deque<int> dq;
        for(int j = 0; j < i; j ++)
            dq.push_back(q[j]);
        // for(auto x : dq)
        //     cout << x << ' ';
        // cout << endl;
        ll mx = 0;
        while(dq.size() > 0){
            int sz = (int)dq.size();
            ll clock = dq[min(sz - 1, k - 1)] + get(dq[min(sz - 1, k - 1)]);
            mx += clock;
            for(int j = 0; j < min(sz, k); j ++)
                dq.pop_front();
        }
        for(int j = i; j < n; j ++)
            dq.push_back(q[j]);
        // for(auto x : dq)
        //     cout << x << ' ';
        // cout << endl;
        while(dq.size() > 0){
            int sz = (int)dq.size();
            ll counterclock = l - dq[max(0, sz - k)] + get(dq[max(0, sz - k)]);
            mx += counterclock;
            for(int j = 0; j < min(sz, k); j ++)
                dq.pop_back();
        }
        // cout << i << ' ' << mx << endl;
        ans = min(ans, mx);
    }
    return ans;
}

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