oj.uz

Submission #963518

# Submission time Handle Problem Language Result Execution time Memory
963518 2024-04-15T08:44:22 Z Hugo1729 Boxes with souvenirs (IOI15_boxes) C++11
100 / 100
 811 ms 294140 KB 
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
typedef long long ll;

ll delivery(int N, int K, int L, int p[]){
    sort(p,p+N);

    vector<ll> left(N+1,0),right(N+1,0);

    for(int i=0;i<N;i++){
        if(i<K){
            left[i+1]=min(p[i]*2,L);
        }else{
            left[i+1]=min(p[i]*2,L)+left[i+1-K];
        }
    }

    for(int i=0;i<N;i++)p[i]=L-p[i];
    sort(p,p+N);

    for(int i=0;i<N;i++){
        if(i<K){
            right[i+1]=min(p[i]*2,L);
        }else{
            right[i+1]=min(p[i]*2,L)+right[i+1-K];
        }
    }

    ll ans=LLONG_MAX;

    for(int i=0;i<N+1;i++)ans=min(ans,left[i]+right[N-i]);

    // for(int i=0;i<N+1;i++)cout << left[i] << ' ';
    // cout << '\n';
    // for(int i=0;i<N+1;i++)cout << right[i] << ' ';
    // cout << '\n';


    return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 1 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 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 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 360 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 0 ms 344 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

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 65 ms 29628 KB Output is correct
34 Correct 36 ms 21956 KB Output is correct
35 Correct 44 ms 22452 KB Output is correct
36 Correct 64 ms 29756 KB Output is correct
37 Correct 61 ms 29788 KB Output is correct
38 Correct 61 ms 29544 KB Output is correct
39 Correct 62 ms 28264 KB Output is correct
40 Correct 43 ms 23644 KB Output is correct
41 Correct 69 ms 30040 KB Output is correct
42 Correct 43 ms 23912 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1 ms 348 KB Output is correct
5 Correct 1 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 360 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 65 ms 29628 KB Output is correct
34 Correct 36 ms 21956 KB Output is correct
35 Correct 44 ms 22452 KB Output is correct
36 Correct 64 ms 29756 KB Output is correct
37 Correct 61 ms 29788 KB Output is correct
38 Correct 61 ms 29544 KB Output is correct
39 Correct 62 ms 28264 KB Output is correct
40 Correct 43 ms 23644 KB Output is correct
41 Correct 69 ms 30040 KB Output is correct
42 Correct 43 ms 23912 KB Output is correct
43 Correct 749 ms 293236 KB Output is correct
44 Correct 390 ms 215688 KB Output is correct
45 Correct 425 ms 223356 KB Output is correct
46 Correct 669 ms 294076 KB Output is correct
47 Correct 672 ms 293816 KB Output is correct
48 Correct 679 ms 293928 KB Output is correct
49 Correct 811 ms 279056 KB Output is correct
50 Correct 461 ms 232688 KB Output is correct
51 Correct 778 ms 294140 KB Output is correct
52 Correct 450 ms 235256 KB Output is correct