Submission #444560

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

boxes

#include "boxes.h"
#include<bits/stdc++.h>
typedef long long ll;

using namespace std;

ll ans;

ll delivery(int n, int k, int l, int p[])
{
    sort(p, p+n);
    for(int i=0; i<n; i++)
        ans+=min(p[i]*2, (l-p[i])*2);
    if(k==n)
    {
        ans=min(ans, 1ll*p[n-1]*2);
        ans=min(ans, 1ll*(l-p[0])*2);
        ans=min(ans, 1ll*l);
        for(int i=0; i<n-1; i++)
            ans=min(ans, 1ll*p[i]*2+1ll*(l-p[i+1])*2);
    }
    return ans;
}

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