oj.uz

Submission #1044978

# Submission time Handle Problem Language Result Execution time Memory
1044978 2024-08-05T15:17:41 Z vanea Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 348 ms 245256 KB 
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
using ll = long long;
using ld = long double;

const ll INF = 1e18;

ll delivery(int n, int k, int l, int p[]) {
    vector<ll> dp1(n+1), dp2(n+2);
    ll ans = INF;
    for(int i = 1; i <= n; i++) {
        int last = max(0, i-k);
        ll lastP = (last ? p[last-1] : 0);
        ll lastP1 = (i-1 ? p[i-2] : 0);
        dp1[i] = dp1[last] + lastP*2 + p[i-1]-lastP;
    }
    for(int i = n; i >= 1; i--) {
        int last = min(n+1, i+k);
        ll lastP = (last != n+1 ? (l-p[last-1]) : 0);
        ll lastP1 = (last != n+1 ? p[last-1] : l);
        dp2[i] = dp2[last] + 2*lastP + lastP1-p[i-1];
    }
    for(int i = 0; i <= n; i++) {
        ll add1 = 0, add2 = 0;
        if(i) add1 = min((ll)p[i-1], (ll)l-p[i-1]);
        if(i != n) add2 = min(p[i], l-p[i]);
        ans = min(ans, add1+add2+dp1[i]+dp2[i+1]);
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:15:12: warning: unused variable 'lastP1' [-Wunused-variable]
   15 |         ll lastP1 = (i-1 ? p[i-2] : 0);
      |            ^~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 432 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 380 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 36 ms 25004 KB Output is correct
34 Correct 14 ms 21360 KB Output is correct
35 Correct 17 ms 21432 KB Output is correct
36 Correct 37 ms 25104 KB Output is correct
37 Correct 36 ms 25172 KB Output is correct
38 Correct 37 ms 25112 KB Output is correct
39 Correct 31 ms 24260 KB Output is correct
40 Correct 18 ms 21888 KB Output is correct
41 Correct 39 ms 25120 KB Output is correct
42 Correct 20 ms 22116 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 432 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 380 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 36 ms 25004 KB Output is correct
34 Correct 14 ms 21360 KB Output is correct
35 Correct 17 ms 21432 KB Output is correct
36 Correct 37 ms 25104 KB Output is correct
37 Correct 36 ms 25172 KB Output is correct
38 Correct 37 ms 25112 KB Output is correct
39 Correct 31 ms 24260 KB Output is correct
40 Correct 18 ms 21888 KB Output is correct
41 Correct 39 ms 25120 KB Output is correct
42 Correct 20 ms 22116 KB Output is correct
43 Correct 348 ms 244752 KB Output is correct
44 Correct 115 ms 205936 KB Output is correct
45 Correct 131 ms 209868 KB Output is correct
46 Correct 347 ms 245256 KB Output is correct
47 Correct 336 ms 245156 KB Output is correct
48 Correct 321 ms 196308 KB Output is correct
49 Correct 273 ms 196176 KB Output is correct
50 Correct 161 ms 195924 KB Output is correct
51 Correct 329 ms 195872 KB Output is correct
52 Correct 161 ms 195924 KB Output is correct