Submission #728434

#	Time	Username	Problem	Language	Result	Execution time	Memory
728434		AndrijaM	선물상자 (IOI15_boxes)	C++14	0 / 100	0 ms	212 KiB

boxes

#include <bits/stdc++.h>

using namespace std;

const long long maxn=2e5+10;

long long delivery(int n, int K, int l, int p[])
{
    long long ans=0;
    long long k=K;
    for(long long i=0;i<n;i++)
    {
        if(k==0)
        {
            k=K;
            ans+=min(2*p[i-1],l);
        }
        k--;
    }
    if(k!=0)
    ans+=min(2*p[n-1],l);
    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