Submission #395762

#	Time	Username	Problem	Language	Result	Execution time	Memory
395762		ScarletS	Boxes with souvenirs (IOI15_boxes)	C++17	0 / 100	1 ms	332 KiB

boxes

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

ll delivery(int n, int k, int l, int p[])
{
	int x=0,y=n-1;
	ll ans=0;
	while (x<=y)
	{
		if (y-x+1<=k)
		{
			ans+=min({l,p[y]*2,(l-p[x])*2});
			break;
		}
		if (p[x+k-1]*2<(l-p[y-k+1])*2)
		{
			ans+=min(l,p[x+k-1]*2);
			x+=k;
		}
		else
		{
			ans+=min(l,p[l-y+k-1]*2);
			y-=k;
		}
	}
    return ans;
}

// int main()
// {
// 	int n,k,l;
// 	cin>>n>>k>>l;
// 	int p[n];
// 	for (int i=0;i<n;++i)
// 		cin>>p[i];
// 	cout<<delivery(n,k,l,p);
// }

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