Submission #728580

#	Time	Username	Problem	Language	Result	Execution time	Memory
728580		AndrijaM	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	212 KiB

boxes

#include <bits/stdc++.h>

using namespace std;

long long delivery(int n, int k, int L, int p[])
{
    long long ans=0;
    long long l=0;
    long long r=n-1;
    while(true)
    {
        if(l>=r)break;
        long long mi1=2e9;
        long long a=l+k-1;
        if(a<=r)
        {
            mi1=min(2*p[a], L);
        }
        long long mi2=2e9;
        long long b=r-k+1;
        if(b>=l)
        {
            mi2=min(2*(n-p[b]-1), L);
        }
        if(mi1<=mi2)
        {
            ans+=mi1;
            l=a;
        }
        else if(mi1>mi2)
        {
            ans+=mi2;
            r=b;
        }
    }
    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