Submission #620151

#	Time	Username	Problem	Language	Result	Execution time	Memory
620151		rrrr10000	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	1 ms	308 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<bool> vb;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define REP(i,k,n) for(ll i=(ll)(k);i<(ll)(n);i++)
#define all(a) a.begin(),a.end()
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pb emplace_back
template<class T> void out(T a){cout<<a<<endl;}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<endl;}
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
const ll inf=1001001001001001001;

long long delivery(int N, int K, int L, int p[]) {
    vi dpl(N),dpr(N);
    rep(i,N){
        dpl[i]=p[i]*2;
        if(i>=K)dpl[i]+=dpl[i-K];
    }
    for(int i=N-1;i>=0;i--){
        dpr[i]=(L-p[i])*2;
        if(i+K<N)dpr[i]+=dpr[i+K];
    }
    ll ans=min(dpl[N-1],dpr[0]);
    rep(i,N-1)chmin(ans,dpl[i]+dpr[i+1]);
    chmin(ans,dpl[N-K]+L);
    chmin(ans,dpr[K]+L);
    rep(i,N-K-1)chmin(ans,dpl[i]+dpr[i+K+1]+L);
    return ans;
}

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