Submission #189247

#	Time	Username	Problem	Language	Result	Execution time	Memory
189247		AQT	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	552 ms	137208 KiB

boxes

#include <bits/stdc++.h>

using namespace std;

long long delivery(int N, int K, int L, int arr[]){
    long long ans = LLONG_MAX;
    for(int k = 0; k<K; k++){
        long long cnt = 0;
        bool b = 0;
        for(int i = k; i-K+1 < N; i+=K){
            if(arr[(i < N ? i : N-1)]*2 >= L){
                b = 1;
            }
            if(arr[(i-K+1 > 0 ? i-K+1 : 0)]*2 <= L && arr[(i < N ? i : N-1)]*2 >= L){
                cnt += L;
            }
            else if(b){
                cnt += (L-arr[(i-K+1 > 0 ? i-K+1 : 0)])*2;
            }
            else{
                cnt += arr[(i < N ? i : N-1)]*2;
            }
        }
        ans = (cnt < ans ? cnt : ans);
    }
    return ans;
}

/*
int main(){
    int arr[3] = {1, 2, 5};
    cout << delivery(3, 2, 8, arr) << endl;
}
*/

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