Submission #284524

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
284524	2020-08-27 14:37:15	IOrtroiii	Boxes with souvenirs (IOI15_boxes)	C++14	10 / 100	1 ms	384 KiB

boxes

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
#include "boxes.h"
 
#include <bits/stdc++.h>
 
using namespace std;
 
long long delivery(int N, int K, int L, int p[]) {
   vector<long long> pref(N);
   vector<long long> suff(N);
   for (int i = 0; i < N; ++i) {
      pref[i] = 2 * p[i];
      if (i >= K) pref[i] += pref[i - K];
   }
   for (int i = N - 1; i >= 0; --i) {
      suff[i] = 2 * (L - p[i]);
      if (i + K < N) suff[i] += suff[i + K];
   }
   long long ans = min(pref[N - 1], suff[0]);
   for (int i = 0; i + 1 < N; ++i) ans = min(ans, pref[i] + suff[i + 1]);
   for (int i = 0; i + 1 + K < N; ++i) ans = min(ans, pref[i] + suff[i + 1 + K] + L);
   return ans;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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