Submission #1008017

#	Time	Username	Problem	Language	Result	Execution time	Memory
1008017		Mardonbekhazratov	Boxes with souvenirs (IOI15_boxes)	C++17	20 / 100	1 ms	348 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    if(K==1){
        ll ans=0;
        for(int i=0;i<N;i++) ans+=min(p[i],L-p[i])*2;
        return ans;
    }
    if(K==N){
        ll ans=L;
        for(int i=0;i<N;i++){
            ans=min(ans,2ll*p[i-1]+(L-p[i])*2);
        }
        ans=min(ans,2LL*min({L-p[0],p[N-1]}));
        return ans;
    }
    return 0;
}

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