oj.uz

Submission #528323

# Submission time Handle Problem Language Result Execution time Memory
528323 2022-02-20T02:11:42 Z Cyanmond Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 593 ms 371656 KB 
// clang-format off
#include "boxes.h"
#include <bits/stdc++.h>

using i64 = int64_t;

template <typename T = int> T scan() {
    T ret; std::cin >> ret;
    return ret;
}

long long solve(const int N, const int K, const int L, std::vector<int> P) {
    std::vector<i64> l_sum(N + 1), r_sum(N + 1);
    l_sum[0] = r_sum[N] = 0;
    for (int i = 0; i < K; ++i) {
        l_sum[i + 1] = std::min({L, 2 * (L - P[0]), 2 * P[i]});
    }
    for (int i = N; i > N - K; --i) {
        r_sum[i - 1] = std::min({L, 2 * P[N - 1], 2 * (L - P[i - 1])});
    }

    for (int i = K; i < N; ++i) {
        const int cost = std::min({L, 2 * P[i], 2 * (L - P[i - K + 1])});
        l_sum[i + 1] = l_sum[i - K + 1] + cost;
    }
    for (int i = N - K; i > 0; --i) {
        const int cost = std::min({L, 2 * (L - P[i - 1]), 2 * P[i + K - 2]});
        r_sum[i - 1] = r_sum[i + K - 1] + cost;
    }

    i64 answer = (i64)5000000000000000;
    for (int i = 0; i <= N; ++i) {
        answer = std::min(answer, l_sum[i] + r_sum[i]);
    }

    return answer;
}

long long delivery(int N, int K, int L, int P[]) {
    std::vector<int> vec(N);
    for (int i = 0; i < N; ++i) vec[i] = P[i];
    return solve(N, K, L, vec);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 53 ms 37352 KB Output is correct
34 Correct 25 ms 29640 KB Output is correct
35 Correct 26 ms 30116 KB Output is correct
36 Correct 62 ms 37492 KB Output is correct
37 Correct 55 ms 37472 KB Output is correct
38 Correct 53 ms 37420 KB Output is correct
39 Correct 51 ms 35928 KB Output is correct
40 Correct 33 ms 31308 KB Output is correct
41 Correct 54 ms 37400 KB Output is correct
42 Correct 30 ms 31476 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 1 ms 308 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 308 KB Output is correct
7 Correct 1 ms 208 KB Output is correct
8 Correct 0 ms 208 KB Output is correct
9 Correct 1 ms 208 KB Output is correct
10 Correct 1 ms 304 KB Output is correct
11 Correct 1 ms 208 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 1 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 0 ms 208 KB Output is correct
17 Correct 1 ms 292 KB Output is correct
18 Correct 1 ms 208 KB Output is correct
19 Correct 0 ms 208 KB Output is correct
20 Correct 1 ms 292 KB Output is correct
21 Correct 0 ms 208 KB Output is correct
22 Correct 1 ms 208 KB Output is correct
23 Correct 1 ms 208 KB Output is correct
24 Correct 1 ms 296 KB Output is correct
25 Correct 1 ms 208 KB Output is correct
26 Correct 1 ms 208 KB Output is correct
27 Correct 1 ms 336 KB Output is correct
28 Correct 1 ms 208 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 208 KB Output is correct
31 Correct 1 ms 208 KB Output is correct
32 Correct 1 ms 300 KB Output is correct
33 Correct 53 ms 37352 KB Output is correct
34 Correct 25 ms 29640 KB Output is correct
35 Correct 26 ms 30116 KB Output is correct
36 Correct 62 ms 37492 KB Output is correct
37 Correct 55 ms 37472 KB Output is correct
38 Correct 53 ms 37420 KB Output is correct
39 Correct 51 ms 35928 KB Output is correct
40 Correct 33 ms 31308 KB Output is correct
41 Correct 54 ms 37400 KB Output is correct
42 Correct 30 ms 31476 KB Output is correct
43 Correct 593 ms 370668 KB Output is correct
44 Correct 243 ms 293844 KB Output is correct
45 Correct 280 ms 301668 KB Output is correct
46 Correct 580 ms 371656 KB Output is correct
47 Correct 569 ms 369644 KB Output is correct
48 Correct 567 ms 359336 KB Output is correct
49 Correct 527 ms 345544 KB Output is correct
50 Correct 309 ms 308316 KB Output is correct
51 Correct 560 ms 355964 KB Output is correct
52 Correct 308 ms 311828 KB Output is correct