Submission #339931

#	Time	Username	Problem	Language	Result	Execution time	Memory
339931		bigDuck	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	364 KiB

boxes

#include "boxes.h"

#include<bits/stdc++.h>
using namespace std;
#define INIT  ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll



int p1[10000010], p2[10000010];

long long delivery(int32_t N, int32_t K, int32_t L, int32_t p[]) {
int k=K, n=N, l=L;

for(int i=0; i<n; i++){
    if(i>=k){
        p1[i]=p1[i-k]+p[i]*2;
    }
    else{
        p1[i]=(p[i]*2);
    }
}
for(int i=n-1; i>=0; i--){
    if((n-1-i)>=k){
        p2[i]=p2[i+k]+(l-( (p[i]==0)?(l):(p[i]) ) ) *2;
    }
    else{
        p2[i]=(l-( (p[i]==0)?(l):(p[i]) ) ) *2;
    }
}
int res=1e18;
res=min(res, p2[0]);
if(n>=k){
    res=min(res, p2[k]+l);
}
for(int i=0; i<n; i++){
    if(i>=k){
        res=min(min(p1[i]+p2[i+1], p1[i-k]+l+p2[i+1]), res);
    }
    else{
        res=min(p1[i]+p2[i+1], res);
    }
}
if(k>=n){
    res=min(res, l);
}
return res;
}

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