oj.uz

Submission #787045

# Submission time Handle Problem Language Result Execution time Memory
787045 2023-07-18T17:03:07 Z GusterGoose27 Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 402 ms 123636 KB 
#include "boxes.h"

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int MAXN = 1e7+5;
ll pre[MAXN];

ll delivery(int n, int k, int l, int p[]) {
    // ll cur = 0;
    // int res = 0;
    for (int i = 0; i < n && p[i] <= l/2; i++) {
        if (i < k) pre[i] = 2*p[i];
        else pre[i] = 2*p[i]+pre[i-k];
        // pre[i] = cur+2*p[i];
        // if (res == k-1) {
        //     cur += 2*p[i];
        //     res = 0;
        //     continue;
        // }
        // res++;
    }
    // cur = 0;
    // res = 0;
    for (int i = n-1; i >= 0 && p[i] > l/2; i--) {
        if (i+k >= n) pre[i] = 2*(l-p[i]);
        else pre[i] = 2*(l-p[i])+pre[i+k];
        // pre[i] = cur+2*(l-p[i]);
        // if (res == k-1) {
        //     cur += 2*(l-p[i]);
        //     res = 0;
        //     continue;
        // }
        // res++;
    }
    int div;
    for (div = 0; div < n && p[div] <= l/2; div++) {}
    ll ans = (div ? pre[div-1] : 0) + pre[div];
    for (int i = div-k+1; i < div; i++) {
        int lp = max(i, 0);
        int rp = min(n-1, i+k-1);
        ans = min(ans, (lp ? pre[lp-1] : 0)+pre[rp+1]+l);
    }
    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 316 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 308 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 316 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 47 ms 18512 KB Output is correct
34 Correct 12 ms 13908 KB Output is correct
35 Correct 17 ms 14452 KB Output is correct
36 Correct 48 ms 16100 KB Output is correct
37 Correct 43 ms 16152 KB Output is correct
38 Correct 45 ms 16112 KB Output is correct
39 Correct 38 ms 16096 KB Output is correct
40 Correct 19 ms 15644 KB Output is correct
41 Correct 42 ms 16124 KB Output is correct
42 Correct 19 ms 15896 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 316 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 316 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 308 KB Output is correct
33 Correct 47 ms 18512 KB Output is correct
34 Correct 12 ms 13908 KB Output is correct
35 Correct 17 ms 14452 KB Output is correct
36 Correct 48 ms 16100 KB Output is correct
37 Correct 43 ms 16152 KB Output is correct
38 Correct 45 ms 16112 KB Output is correct
39 Correct 38 ms 16096 KB Output is correct
40 Correct 19 ms 15644 KB Output is correct
41 Correct 42 ms 16124 KB Output is correct
42 Correct 19 ms 15896 KB Output is correct
43 Correct 394 ms 123580 KB Output is correct
44 Correct 118 ms 120080 KB Output is correct
45 Correct 147 ms 120160 KB Output is correct
46 Correct 402 ms 123500 KB Output is correct
47 Correct 394 ms 123492 KB Output is correct
48 Correct 394 ms 123508 KB Output is correct
49 Correct 344 ms 123620 KB Output is correct
50 Correct 176 ms 118504 KB Output is correct
51 Correct 398 ms 123636 KB Output is correct
52 Correct 177 ms 118216 KB Output is correct