Submission #470111

#	Time	Username	Problem	Language	Result	Execution time	Memory
470111		Cross_Ratio	Boxes with souvenirs (IOI15_boxes)	C++14	25 / 100	2 ms	332 KiB

boxes

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

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