Submission #441841

#	Time	Username	Problem	Language	Result	Execution time	Memory
441841		NintsiChkhaidze	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	1 ms	204 KiB

boxes

#include "boxes.h"
#include <iostream>
#define ll long long
using namespace std;
const int N = 1000005;
ll dp[N];
ll delivery(int n, int k, int l, int p[]) {
    for (int i = 0; i < n; i++){
      int id = p[i];
      if (i < k){
        dp[i] = min(id*2,min(l,(n - p[0])*2));
      }
      else{
        int st = p[i - k + 1];
        dp[i] = dp[i - k] + min(id*2,min(l,(l - st)*2));
      }
    }
    return dp[n - 1];
}

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