oj.uz

Submission #427777

# Submission time Handle Problem Language Result Execution time Memory
427777 2021-06-14T22:19:21 Z illyakr Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 625 ms 372076 KB 
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
#define ll long long

ll dpFOR[10000002];
ll dpBACK[10000002];
ll a[10000002];
ll res = 1010101010;
long long delivery(int N, int K, int L, int p[]) {
    for (int i = 1; i <= N; i++)
        a[i] = p[i - 1];

    for (int i = 1; i <= N; i++) {
        if (i <= K)dpFOR[i] = a[i] + min(a[i], L - a[i]);
        else dpFOR[i] = dpFOR[i - K] + a[i] + min(a[i], L - a[i]);
    }
    for (int i = N; i >= 1; i--) {
        if (N - i + 1 <= K)dpBACK[i] = (L - a[i]) + min(a[i], L - a[i]);
        else dpBACK[i] = dpBACK[i + K] + (L - a[i]) + min(a[i], L - a[i]);
    }
//    for (int i = 1; i <= N; i++) {
//        cout << dpFOR[i] << " ";
//    }
//    cout << endl;
//    for (int i = 1; i <= N; i++) {
//        cout << dpBACK[i] << " ";
//    }
//    cout << endl;
    res = min(dpFOR[N], dpBACK[1]);
    for (int i = 1; i < N; i++) {
        res = min(res, dpFOR[i] + dpBACK[i + 1]);
    }
    return res;
}
/**
3 2 8
1 2 5

*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 304 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 304 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 60 ms 37348 KB Output is correct
34 Correct 26 ms 29636 KB Output is correct
35 Correct 35 ms 30096 KB Output is correct
36 Correct 66 ms 37408 KB Output is correct
37 Correct 65 ms 37444 KB Output is correct
38 Correct 60 ms 37396 KB Output is correct
39 Correct 55 ms 35936 KB Output is correct
40 Correct 36 ms 31260 KB Output is correct
41 Correct 60 ms 37448 KB Output is correct
42 Correct 33 ms 31600 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 1 ms 296 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 304 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 60 ms 37348 KB Output is correct
34 Correct 26 ms 29636 KB Output is correct
35 Correct 35 ms 30096 KB Output is correct
36 Correct 66 ms 37408 KB Output is correct
37 Correct 65 ms 37444 KB Output is correct
38 Correct 60 ms 37396 KB Output is correct
39 Correct 55 ms 35936 KB Output is correct
40 Correct 36 ms 31260 KB Output is correct
41 Correct 60 ms 37448 KB Output is correct
42 Correct 33 ms 31600 KB Output is correct
43 Correct 590 ms 281040 KB Output is correct
44 Correct 256 ms 275600 KB Output is correct
45 Correct 276 ms 276028 KB Output is correct
46 Correct 584 ms 280852 KB Output is correct
47 Correct 625 ms 372076 KB Output is correct
48 Correct 591 ms 280164 KB Output is correct
49 Correct 514 ms 279224 KB Output is correct
50 Correct 315 ms 276308 KB Output is correct
51 Correct 575 ms 279364 KB Output is correct
52 Correct 332 ms 276040 KB Output is correct