Submission #778082

#	Time	Username	Problem	Language	Result	Execution time	Memory
778082		Jarif_Rahman	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	641 ms	338916 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;
const int K = 1e7;

ll S[K];

ll delivery(int n, int k, int L, int P[]){
    vector<ll> A(n+1), B(n+1);
    A[0] = 0, B[n] = 0;

    fill(S, S+k, 0);
    for(int i = 1; i <= n; i++){
        S[i%k]+=2*P[i-1];
        A[i] = S[i%k];
    }
    fill(S, S+k, 0);
    for(int i = n-1; i >= 0; i--){
        S[(n-i)%k]+=2*(L-P[i]);
        B[i] = S[(n-i)%k];
    }

    vector<ll> C(n+1);
    C[n] = 0;
    for(int i = n-1; i >= 0; i--){
        C[i] = ll((n-i+k-1)/k)*L;
        C[i] = min(C[i], B[i]);
        if(i+k <= n) C[i] = min(C[i], C[i+k]+L);
    }

    ll ans = 1e18;
    for(int i = 0; i <= n; i++) ans = min(ans, A[i]+C[i]);
    return ans;
}

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