Submission #431853

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
431853	2021-06-17 16:09:21	muhammad_hokimiyon	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	1030 ms	352740 KiB

boxes

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "boxes.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define ll long long
#define dl double
using namespace std;
ll delivery(int N, int K, int LE, int P[])
{
        vector<ll> d(N + 1, 1e18);
        d[0] = 0;
        vector<ll> p(N + 1, 0);
        for(int i = 1; i <= N; i++)p[i] = P[i - 1];
        sort(p.begin(), p.end());
        vector<ll> L(N + 1, 0ll), R(N + 2, 0ll);
        for(int i = 1; i <= N; i++){
                L[i] = L[max(0, i - K)] + p[i] + p[i];
        }
        for(int i = N; i >= 1; i--){
                R[i] = R[min(N + 1, i + K)] + (LE - p[i]) * 2ll;
        }
        ll ans = 1e18;
        for(int i = 0; i <= N; i++){
                ans = min(ans, L[i] + R[i + 1]);
        }
        for(int i = 1; i <= N; i++){
                if(i + K - 1 > N)break;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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