oj.uz

Submission #1009753

# Submission time Handle Problem Language Result Execution time Memory
1009753 2024-06-28T03:18:51 Z hotboy2703 Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 445 ms 293872 KB 
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define pll pair <ll,ll>
#define fi first
#define se second
#define MP make_pair
#define sz(a) (ll((a).size()))
#define BIT(mask,i) (((mask) >> (i))&1)
#define MASK(i) (1LL << (i))
const ll MAXN = 1e7 + 100;
ll dp1[MAXN];
ll dp2[MAXN];
long long delivery(int n, int k, int L, int p[]) {
    ll res = 1e18;
    for (ll i = 0;i < n;i ++){
        ll id_l = (i-k+1);
        if (id_l < 0)id_l = 0;
        if (p[id_l] * 2 > L){
            dp1[i] = -1;
            continue;
        }
        if (i-k>=0){
            dp1[i] = dp1[i-k] + min(L,p[i]*2);
        }
        else{
            dp1[i] = min(L,p[i]*2);
        }
        if (i == n - 1)res = min(res,dp1[i]);
    }
    for (ll i = n - 1;i >= 0;i --){
        if (p[i] * 2 <= L)break;
        if (i + k >= n){
            dp2[i] = min(L,(L-p[i])*2);
        }
        else{
            dp2[i] = min(L,(L-p[i])*2)+dp2[i+k];
        }
        ll id_l = i-k;
        if (id_l < 0)id_l = 0;
        if (i >= 1 && p[id_l] * 2 <= L){
            res = min(res,dp2[i]+dp1[i-1]);
        }
        if (i==0)res = min(res,dp2[i]);
    }
//    for (ll i = 0;i < n;i ++){
//        cout<<dp1[i]<<' ';
//    }
//    cout<<'\n';
//    for (ll i = 0;i < n;i ++){
//        cout<<dp2[i]<<' ';
//    }
//    cout<<'\n';
    return res;
}

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 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 448 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 440 KB Output is correct
3 Correct 0 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 444 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 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 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 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 448 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 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 444 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 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 0 ms 348 KB Output is correct
23 Correct 0 ms 344 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 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 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 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 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 448 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 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 444 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 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 0 ms 348 KB Output is correct
23 Correct 0 ms 344 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 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 42 ms 25748 KB Output is correct
34 Correct 13 ms 17244 KB Output is correct
35 Correct 16 ms 18008 KB Output is correct
36 Correct 44 ms 29644 KB Output is correct
37 Correct 43 ms 29536 KB Output is correct
38 Correct 42 ms 23124 KB Output is correct
39 Correct 36 ms 24176 KB Output is correct
40 Correct 20 ms 19636 KB Output is correct
41 Correct 43 ms 29740 KB Output is correct
42 Correct 23 ms 23692 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 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 448 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 440 KB Output is correct
10 Correct 0 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 444 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 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 0 ms 348 KB Output is correct
23 Correct 0 ms 344 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 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 42 ms 25748 KB Output is correct
34 Correct 13 ms 17244 KB Output is correct
35 Correct 16 ms 18008 KB Output is correct
36 Correct 44 ms 29644 KB Output is correct
37 Correct 43 ms 29536 KB Output is correct
38 Correct 42 ms 23124 KB Output is correct
39 Correct 36 ms 24176 KB Output is correct
40 Correct 20 ms 19636 KB Output is correct
41 Correct 43 ms 29740 KB Output is correct
42 Correct 23 ms 23692 KB Output is correct
43 Correct 402 ms 253524 KB Output is correct
44 Correct 130 ms 168620 KB Output is correct
45 Correct 153 ms 182740 KB Output is correct
46 Correct 386 ms 215264 KB Output is correct
47 Correct 384 ms 279020 KB Output is correct
48 Correct 403 ms 293872 KB Output is correct
49 Correct 334 ms 239332 KB Output is correct
50 Correct 200 ms 193592 KB Output is correct
51 Correct 445 ms 293496 KB Output is correct
52 Correct 225 ms 235088 KB Output is correct