제출 #425532

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
425532		haxorman	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	260 KiB

boxes

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

int n, k, l;

long long delivery(int N, int K, int L, int p[]) {
    n = N, k = K, l = L;

    long long ans = 0;

    if (k == 1) {
        for (int i = 0; i < n; ++i) {
            ans += min(p[i], (l - 1) - p[i] + 1) * 2;
        }
    }
    else if (k == n) {
        int lb = -1, rb = n - 1;
        while (rb - lb > 1) {
            int mid = (lb + rb) / 2;

            if (p[mid] <= l / 2) {
                lb = mid;
            }
            else {
                rb = mid;
            }
        }
        if (lb != -1) {
            ans += 2 * p[lb];
        }

        lb = 0, rb = n;
        while (rb - lb > 1) {
            int mid = (lb + rb) / 2;

            if (p[mid] > l / 2) {
                rb = mid;
            }
            else {
                lb = mid;
            }
        }

        if (rb != n) {
            ans += 2 * ((l - 1) - p[rb] + 1);
        }
        ans = min(ans, (long long) l);
    }
    return ans;
}

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