제출 #172090

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
172090		gs18103	선물상자 (IOI15_boxes)	C++14	0 / 100	3 ms	376 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define eb emplace_back
#define em emplace
#define all(v) v.begin(), v.end()

using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int MAX = 101010;
const int INF = 1e9;
const ll LINF = 1e18;

long long delivery(int N, int K, int L, int p[]) {
    vector <ll> l, r;
    for(int i = 0; i < N; i++) {
        if(p[i] == 0) continue;
        if(p[i] <= L / 2) l.eb(p[i]);
        else r.eb(L-p[i]);
    }
    ll ans = 0;
    if(!l.empty() && !r.empty() && l.back() + r.back() > L / 2) {
        ans += L;
        for(int i = 0; i < K; i++) {
            if(l.empty() && r.empty()) break;
            if(l.empty()) r.pop_back();
            else if(r.empty()) l.pop_back();
            else if(l.back() > r.back()) l.pop_back();
            else r.pop_back();
        }
    }
    while(!l.empty()) {
        ans += 2 * l.back();
        for(int i = 0; i < K; i++) if(!l.empty()) l.pop_back();
    }
    while(!r.empty()) {
        ans += 2 * r.back();
        for(int i = 0; i < K; i++) if(!r.empty()) r.pop_back();
    }
    return ans;
}

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