Submission #397009

#	Time	Username	Problem	Language	Result	Execution time	Memory
397009		Andyvanh1	Boxes with souvenirs (IOI15_boxes)	C++14	70 / 100	2091 ms	321172 KiB

boxes

#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <stack>
#include <queue>
#include <map>
#include <math.h>

using namespace std;

#define pb push_back
#define INF INT32_MAX
#define vt vector


typedef vt<int> vi;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tiii;
typedef long long ll;





#define MOD  1000000007


ll delivery(int n, int k, int l, int arr[]){

    vt<ll> vals1(n+1);
    vt<ll> vals2(n+1);
    vt<ll> dp(n+1);
    dp[0] = 0;
    multiset<ll> pq1;
    pq1.insert(dp[0]-2*arr[0]);
    vals1[0]=dp[0]-2*arr[0];

    vals2[0] = 0;
    for(int i = 1; i <= n; i++){
        dp[i] = *(pq1.begin())+2*l;
        ll cur = 0;
        if(i-k>=0){
            cur = dp[i-k];
        }
        dp[i] = min(dp[i],min(cur+2*arr[i-1],cur+l));
        if(i!=n) {
            vals1[i] = dp[i] - 2 * arr[i];
            vals2[i] = dp[i];
            pq1.insert(vals1[i]);

        }


        if(i-k>=0){
            pq1.erase(pq1.find(vals1[i-k]));


        }


    }
    return dp[n];


}

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