oj.uz

Submission #963552

# Submission time Handle Problem Language Result Execution time Memory
963552 2024-04-15T09:52:42 Z Hugo1729 Boxes with souvenirs (IOI15_boxes) C++11
100 / 100
 462 ms 294012 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[]){

    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);
            right[i+1]=min((L-p[N-1-i])*2,L);
        }else{
            left[i+1]=min(p[i]*2,L)+left[i+1-K];
            right[i+1]=min((L-p[N-1-i])*2,L)+right[i+1-K];
        }
    }

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

    // 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 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 440 KB Output is correct

Subtask #2
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 0 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 440 KB Output is correct
8 Correct 1 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 0 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 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 0 ms 440 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 356 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 440 KB Output is correct
8 Correct 1 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 0 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 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 0 ms 440 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 356 KB Output is correct
33 Correct 42 ms 29648 KB Output is correct
34 Correct 15 ms 21860 KB Output is correct
35 Correct 16 ms 22372 KB Output is correct
36 Correct 45 ms 29752 KB Output is correct
37 Correct 41 ms 29560 KB Output is correct
38 Correct 42 ms 29704 KB Output is correct
39 Correct 35 ms 28244 KB Output is correct
40 Correct 21 ms 23632 KB Output is correct
41 Correct 41 ms 29580 KB Output is correct
42 Correct 21 ms 23812 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 440 KB Output is correct
8 Correct 1 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 0 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 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 352 KB Output is correct
26 Correct 0 ms 352 KB Output is correct
27 Correct 1 ms 352 KB Output is correct
28 Correct 0 ms 440 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 356 KB Output is correct
33 Correct 42 ms 29648 KB Output is correct
34 Correct 15 ms 21860 KB Output is correct
35 Correct 16 ms 22372 KB Output is correct
36 Correct 45 ms 29752 KB Output is correct
37 Correct 41 ms 29560 KB Output is correct
38 Correct 42 ms 29704 KB Output is correct
39 Correct 35 ms 28244 KB Output is correct
40 Correct 21 ms 23632 KB Output is correct
41 Correct 41 ms 29580 KB Output is correct
42 Correct 21 ms 23812 KB Output is correct
43 Correct 462 ms 292808 KB Output is correct
44 Correct 159 ms 215648 KB Output is correct
45 Correct 197 ms 223684 KB Output is correct
46 Correct 451 ms 293616 KB Output is correct
47 Correct 457 ms 293844 KB Output is correct
48 Correct 436 ms 293648 KB Output is correct
49 Correct 396 ms 278936 KB Output is correct
50 Correct 213 ms 232300 KB Output is correct
51 Correct 425 ms 294012 KB Output is correct
52 Correct 219 ms 235120 KB Output is correct