oj.uz

Submission #287135

# Submission time Handle Problem Language Result Execution time Memory
287135 2020-08-31T12:30:19 Z Kastanda Boxes with souvenirs (IOI15_boxes) C++11
100 / 100
 565 ms 236664 KB 
// M
#include<bits/stdc++.h>
#include "boxes.h"
using namespace std;
typedef long long ll;
const int N = 10000007;
int n, k, L, A[N];
ll P[N], S[N];

long long delivery(int _n, int _k, int _L, int _p[])
{
        k = _k; L = _L;
        for (int i = 0; i < _n; i ++)
                if (_p[i])
                        A[++ n] = _p[i];

        ll Mn = (n + k - 1) / k * (ll)L;
        for (int i = 1; i <= n; i ++)
        {
                if (i >= k)
                        P[i] = P[i - k];
                P[i] += A[i];
        }
        for (int i = n; i; i --)
        {
                if (i + k <= n)
                        S[i] = S[i + k];
                S[i] += L - A[i];
        }
        for (int i = 0; i <= n; i ++)
        {
                Mn = min(Mn, (P[i] + S[i + 1]) * 2LL);

                ll s = 0;
                if (i + k + 1 <= n)
                        s = S[i + k + 1];

                Mn = min(Mn, (P[i] + s) * 2LL + L);
        }
        return Mn;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 57 ms 25080 KB Output is correct
34 Correct 25 ms 20864 KB Output is correct
35 Correct 28 ms 24060 KB Output is correct
36 Correct 61 ms 25208 KB Output is correct
37 Correct 58 ms 25080 KB Output is correct
38 Correct 58 ms 25208 KB Output is correct
39 Correct 52 ms 25080 KB Output is correct
40 Correct 33 ms 25084 KB Output is correct
41 Correct 57 ms 25080 KB Output is correct
42 Correct 34 ms 25128 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 1 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 57 ms 25080 KB Output is correct
34 Correct 25 ms 20864 KB Output is correct
35 Correct 28 ms 24060 KB Output is correct
36 Correct 61 ms 25208 KB Output is correct
37 Correct 58 ms 25080 KB Output is correct
38 Correct 58 ms 25208 KB Output is correct
39 Correct 52 ms 25080 KB Output is correct
40 Correct 33 ms 25084 KB Output is correct
41 Correct 57 ms 25080 KB Output is correct
42 Correct 34 ms 25128 KB Output is correct
43 Correct 565 ms 236536 KB Output is correct
44 Correct 224 ms 196344 KB Output is correct
45 Correct 279 ms 232588 KB Output is correct
46 Correct 561 ms 236536 KB Output is correct
47 Correct 555 ms 236536 KB Output is correct
48 Correct 560 ms 236536 KB Output is correct
49 Correct 516 ms 236536 KB Output is correct
50 Correct 321 ms 236004 KB Output is correct
51 Correct 562 ms 236664 KB Output is correct
52 Correct 347 ms 236536 KB Output is correct