Submission #591303

#	Time	Username	Problem	Language	Result	Execution time	Memory
591303		KrisjanisP	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	256 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll,ll>;

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

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