Submission #608522

#	Time	Username	Problem	Language	Result	Execution time	Memory
608522		loctildore	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	585 ms	259040 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
// trans rights
#define ll long long
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x), end(x)
ll n,k,l;
ll dp1[10000069],dp2[10000069];
long long delivery(int N, int K, int Li, int p[]) {
  n=N;k=K;l=Li;
  for (ll i = 0; i < n; i++) {
    if (i<k) {
      dp1[i]=p[i]+min((ll)p[i],l-p[i]);
    }
    else {
      dp1[i]=dp1[i-k]+p[i]+min((ll)p[i],l-p[i]);
    }
  }
  for (ll i = n-1; ~i; i--) {
    if (n<=k+i) {
      dp2[i]=l-p[i]+min((ll)p[i],l-p[i]);
    }
    else {
      dp2[i]=dp2[i+k]+l-p[i]+min((ll)p[i],l-p[i]);
    }
  }
  ll ans=dp2[0];
  for (ll i = 0; i < n; i++) {
    ans=min(ans,dp1[i]+dp2[i+1]);
  }
  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