Submission #65272

#	Time	Username	Problem	Language	Result	Execution time	Memory
65272		KHUSRAV	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	4 ms	376 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std ;
pair<long long , long long> dppred[10000001] , dpfirst[10000001];
long long delivery(int N, int K, int L, int p[]) {
    int l = 0 ;
    int r = N - 1 ;
    long long ans = 1e18 ;
    while(l + 1 < r){
        int m = (l + r) / 2 ;
        if(L / 2 <= p[m]) r = m ;
        else l = m ;
    }
    for(int i = 0 ; i <= N ; i ++){
        long long s = 0 ;
        for(int j = l ; j >=0 ; j -= K)
            s = s + 2 * p[j];
        for(int j = r ; j < N ; j += K)
            s = s + 2 * (L - p[j]);
        ans = min(ans , i * L + s);
        for(int j = 1 ; j <= K ; j ++){
            if(l >= 0 && r < N){
                if(L / 2 - p[l] <= p[r] - L / 2){
                    l -- ;
                }
                else r ++ ;
            }
            else if(l >= 0)
                l -- ;
            else if(r < N)
                r ++ ;
        }
    }
    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