제출 #618829

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
618829		Hazem	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	320 KiB

boxes

#include <bits/stdc++.h>
#define LL long long

using namespace std;

LL a[100010];

long long delivery(int N, int K, int L, int p[]) {
    
    int n = N,k = K;    
    LL L1 = L;
    for(int i=1;i<=n;i++)
        a[i] = p[i-1];

    sort(a+1,a+n+1);

    LL l = 1,r = n;
    LL ret = 0;
    for(int i=1;i<=(n+k-1)/k;i++){
        LL ans1 = a[min(l+k-1,r)]*2;
        LL ans2 = (L1-a[max(r-k+1,l)])*2;
        
        ans1 = min(ans1,L1);
        ans2 = min(ans2,L1);

        if(ans1<ans2){
            ret += ans1;
            l += k;
        }
        else {
            ret += ans2;
            r -= k;
        }
    }

    return ret;
}

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