제출 #470108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
470108		Cross_Ratio	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	2 ms	332 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
#include "boxes.h"
const long long int INF = 1e18;
int A[50000006];
int B[50000006];
int cnt1, cnt2;
long long int C[50000006];
long long int D[50000006];
long long delivery(int N, int K, int L, int* P) {
    int i, j;
    for(i=0;i<N;i++) {
        if(P[i] < L/2) {
            A[cnt1++] = P[i];
        }
        else B[cnt2++] = L - P[i];
    }
    reverse(B, B + cnt2);
    for(i=0;i<cnt1;i++) {
        if(i < K) C[i] = 2 * A[i];
        else C[i] = C[i-K] + 2*A[i];
    }
    for(i=0;i<cnt2;i++) {
        if(i < K) D[i] = 2 * B[i];
        else D[i] = D[i-K] + 2*B[i];
    }
    long long int ans = INF;
    for(i=0;i<cnt1;i++) {
        for(j=0;j<cnt2;j++) {
            int c = cnt1 - i + cnt2 - j - 2;
            ans = min(ans, C[i] + D[j] + (c - 1 + K) / K * L);
        }
    }
    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