Submission #316871

#	Time	Username	Problem	Language	Result	Execution time	Memory
316871		Sho10	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	529 ms	213880 KiB

boxes

#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll pref[10000005],suf[10000005];
ll delivery(int n,int k,int l,int a[]){
for(ll i=0;i<n;i++)
{
    pref[i+1]=2*a[i];
    if(i>=k){
        pref[i+1]+=pref[i+1-k];
    }
}
for(ll i=n-1;i>=0;i--)
{
    suf[i]=2*(l-a[i]);
    if(i+k<=n){
        suf[i]+=suf[i+k];
    }
}
ll ans=LINF;
for(ll i=0;i<=n;i++)
{
    ans=min(ans,pref[i]+suf[i]);
    if(i+k<=n){
        ans=min(ans,pref[i]+suf[i+k]+l);
    }
}
return ans;
}
/*
int32_t main(){
CODE_START;
*/

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