oj.uz

Submission #1085477

# Submission time Handle Problem Language Result Execution time Memory
1085477 2024-09-08T10:09:12 Z alexdd Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 636 ms 333176 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18;
long long dple[10000005],dpri[10000005];
vector<int> a;
long long delivery(int N, int K, int L, int p[])
{
    a.push_back(0);
    for(int i=0;i<N;i++)
        if(p[i]!=0)
            a.push_back(p[i]);
    N = (int)a.size()-1;
    a.push_back(L);
    K = min(K, N);
    if(N==0)
    {
        return 0;
    }
    for(int r=0;r<K;r++)
    {
        dple[r] = a[r]*2;
        for(int i=r+K;i<=N;i+=K)
            dple[i] = dple[i-K] + a[i]*2;
    }
    for(int r=0;r<K;r++)
    {
        dpri[r] = (L-a[N-r+1])*2;
        for(int i=r+K;i<=N;i+=K)
            dpri[i] = dpri[i-K] + (L-a[N-i+1])*2;
    }
    long long rez=INF;
    for(int cntle=0;cntle<=N;cntle++)
    {
        if(a[cntle] >= (L+1)/2 || a[min(N+1,cntle+K)] < (L+1)/2)
            continue;
        for(int cntc=0;cntle+cntc*K<=N;cntc++)
        {
            int cntri = N - cntle - cntc*K;
            rez = min(rez, dple[cntle] + dpri[cntri] + 1LL*L*cntc);
        }
    }
    return rez;
}
/*
3 2 8
1 2 5
output: 10

*/

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 1 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 0 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 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 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 448 KB Output is correct
8 Correct 0 ms 348 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 1 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 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 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 0 ms 348 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 448 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 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 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 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 1 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 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 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 0 ms 348 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 448 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 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 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 53 ms 33780 KB Output is correct
34 Correct 21 ms 21960 KB Output is correct
35 Correct 23 ms 25544 KB Output is correct
36 Correct 55 ms 33728 KB Output is correct
37 Correct 60 ms 33680 KB Output is correct
38 Correct 61 ms 33648 KB Output is correct
39 Correct 48 ms 32188 KB Output is correct
40 Correct 37 ms 27580 KB Output is correct
41 Correct 58 ms 33824 KB Output is correct
42 Correct 35 ms 27816 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 1 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 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 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 0 ms 348 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 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 448 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 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 348 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 53 ms 33780 KB Output is correct
34 Correct 21 ms 21960 KB Output is correct
35 Correct 23 ms 25544 KB Output is correct
36 Correct 55 ms 33728 KB Output is correct
37 Correct 60 ms 33680 KB Output is correct
38 Correct 61 ms 33648 KB Output is correct
39 Correct 48 ms 32188 KB Output is correct
40 Correct 37 ms 27580 KB Output is correct
41 Correct 58 ms 33824 KB Output is correct
42 Correct 35 ms 27816 KB Output is correct
43 Correct 515 ms 332268 KB Output is correct
44 Correct 182 ms 215668 KB Output is correct
45 Correct 260 ms 258708 KB Output is correct
46 Correct 539 ms 333176 KB Output is correct
47 Correct 536 ms 333032 KB Output is correct
48 Correct 636 ms 333028 KB Output is correct
49 Correct 467 ms 317480 KB Output is correct
50 Correct 286 ms 271156 KB Output is correct
51 Correct 543 ms 332872 KB Output is correct
52 Correct 289 ms 274412 KB Output is correct