Submission #1217005

#	Time	Username	Problem	Language	Result	Execution time	Memory
1217005		matere	Boxes with souvenirs (IOI15_boxes)	C++20	0 / 100	1 ms	324 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std; 
ll a[10000005],dp1[10000005],dp2[10000005],n,k,l;
ll delivery(int nn,int kk,int lll,int b[]){
    n=nn,k=kk,l=lll;
    for(ll i=1;i<=n;i++){
        a[i]=b[i-1];
        dp1[i]=dp1[a[max(0ll,i-k)]]+a[i]+min(a[i],(l-a[i]));
        // cout<<dp1[i]<<' ';
    }
    // cout<<endl;
    for(ll i=n;i>=1;i--){
        dp2[i]=dp2[a[min(n+1,i+k)]]+(l-a[i])+min(a[i],(n-a[i]));
        // cout<<dp2[i]<<' ';
    }
    ll ans=0;
    for(ll i=1;i<=n;i++){
        ans=max(ans,dp1[i]+dp2[i+1]);
    }
    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