oj.uz

Submission #768538

# Submission time Handle Problem Language Result Execution time Memory
768538 2023-06-28T08:53:48 Z borisAngelov Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 556 ms 332964 KB 
#include "boxes.h"

#include <iostream>
#include <vector>

using namespace std;

const int maxn = 10000005;

int n, k, l;

int positions[maxn];

long long dp_left[maxn];
long long dp_right[maxn];

long long delivery(int N, int K, int L, int p[])
{
    n = N;
    k = K;
    l = L;

    for (int i = 1; i <= n; ++i)
    {
        positions[i] = p[i - 1];
    }

    dp_left[0] = 0;
    dp_right[n + 1] = 0;

    for (int i = 1; i <= n; ++i)
    {
        if (i <= k)
        {
            dp_left[i] = 2 * positions[i];
        }
        else
        {
            dp_left[i] = dp_left[i - k] + 2 * positions[i];
        }
    }

    for (int i = n; i >= 1; --i)
    {
        if (n - i + 1 <= k)
        {
            dp_right[i] = 2 * (l - positions[i]);
        }
        else
        {
            dp_right[i] = dp_right[i + k] + 2 * (l - positions[i]);
        }
    }

    long long ans = (1LL << 62);

    if (n <= k)
    {
        ans = l;
    }

    for (int i = 0; i <= n; ++i)
    {
        ans = min(ans, dp_left[i] + dp_right[i + 1]);
    }

    for (int i = 0; i <= n; ++i)
    {
        if (i + k + 1 > n + 1)
        {
            break;
        }

        ans = min(ans, dp_left[i] + l + dp_right[i + k + 1]);
    }

    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 1 ms 320 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 372 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 308 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 308 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 1 ms 320 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 372 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 308 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 340 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 1 ms 320 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 372 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 308 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 47 ms 33440 KB Output is correct
34 Correct 21 ms 25736 KB Output is correct
35 Correct 26 ms 26152 KB Output is correct
36 Correct 46 ms 33536 KB Output is correct
37 Correct 48 ms 33496 KB Output is correct
38 Correct 49 ms 33564 KB Output is correct
39 Correct 43 ms 31996 KB Output is correct
40 Correct 25 ms 27428 KB Output is correct
41 Correct 49 ms 33588 KB Output is correct
42 Correct 26 ms 27676 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 1 ms 320 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 372 KB Output is correct
8 Correct 1 ms 308 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 308 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 312 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 324 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 47 ms 33440 KB Output is correct
34 Correct 21 ms 25736 KB Output is correct
35 Correct 26 ms 26152 KB Output is correct
36 Correct 46 ms 33536 KB Output is correct
37 Correct 48 ms 33496 KB Output is correct
38 Correct 49 ms 33564 KB Output is correct
39 Correct 43 ms 31996 KB Output is correct
40 Correct 25 ms 27428 KB Output is correct
41 Correct 49 ms 33588 KB Output is correct
42 Correct 26 ms 27676 KB Output is correct
43 Correct 556 ms 314032 KB Output is correct
44 Correct 214 ms 254660 KB Output is correct
45 Correct 222 ms 262436 KB Output is correct
46 Correct 501 ms 332888 KB Output is correct
47 Correct 495 ms 332868 KB Output is correct
48 Correct 476 ms 332928 KB Output is correct
49 Correct 435 ms 317736 KB Output is correct
50 Correct 283 ms 271560 KB Output is correct
51 Correct 472 ms 332964 KB Output is correct
52 Correct 267 ms 274216 KB Output is correct