Submission #933820

# Submission time Handle Problem Language Result Execution time Memory
933820 2024-02-26T11:12:05 Z raul2008487 Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
411 ms 293712 KB
#include <bits/stdc++.h>
#include "boxes.h"
#define ll long long
#define in insert
#define pb push_back
#define vl vector<ll>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define endl "\n"
using namespace std;
const ll inf = 100000000000000000;
long long delivery(int N, int K, int L, int p[]) {
    ll n = N, k = K, ans = inf, i, j;
    vl dpp(n + 2), dps(n + 2);
    dpp[0] = dps[n + 1] = 0;
    for(i = 1; i <= n; i++){
        if(i > k){
            dpp[i] = dpp[i - k] + min(p[i - 1] * 2, L);
        }
        else{
            dpp[i] = min(p[i - 1] * 2, L);
        }
        //dpp[i] = dpp[pr] + p[i - 1] + min(L - p[i - 1], p[i - 1]);
    }
    for(i = n; i > 0; i--){
        ll nxt = min(i + k, n + 1);
        if((i + k) <= n){
            dps[i] = dps[i + k] + min(L, 2 * (L - p[i - 1]));
        }
        else{
            dps[i] = min(L, 2 * (L - p[i - 1]));
        }
        //dps[i] = dps[nxt] + (L - p[i - 1]) + min(L - p[i - 1], p[i - 1]);
    }
    for(i = 0; i <= n; i++){
        ans = min(ans, (dpp[i] + dps[i + 1]));
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:27:12: warning: unused variable 'nxt' [-Wunused-variable]
   27 |         ll nxt = min(i + k, n + 1);
      |            ^~~
boxes.cpp:14:36: warning: unused variable 'j' [-Wunused-variable]
   14 |     ll n = N, k = K, ans = inf, i, j;
      |                                    ^
# 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 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 348 KB Output is correct
# 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 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 348 KB Output is correct
# 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
# 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 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 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 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 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 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 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 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
# 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 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 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 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 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 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 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 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 40 ms 29656 KB Output is correct
34 Correct 14 ms 21968 KB Output is correct
35 Correct 16 ms 22364 KB Output is correct
36 Correct 44 ms 29780 KB Output is correct
37 Correct 41 ms 29652 KB Output is correct
38 Correct 42 ms 29712 KB Output is correct
39 Correct 36 ms 28240 KB Output is correct
40 Correct 21 ms 23468 KB Output is correct
41 Correct 41 ms 29636 KB Output is correct
42 Correct 20 ms 23900 KB Output is correct
# 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 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 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 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 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 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 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 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 40 ms 29656 KB Output is correct
34 Correct 14 ms 21968 KB Output is correct
35 Correct 16 ms 22364 KB Output is correct
36 Correct 44 ms 29780 KB Output is correct
37 Correct 41 ms 29652 KB Output is correct
38 Correct 42 ms 29712 KB Output is correct
39 Correct 36 ms 28240 KB Output is correct
40 Correct 21 ms 23468 KB Output is correct
41 Correct 41 ms 29636 KB Output is correct
42 Correct 20 ms 23900 KB Output is correct
43 Correct 411 ms 292688 KB Output is correct
44 Correct 128 ms 215584 KB Output is correct
45 Correct 156 ms 223572 KB Output is correct
46 Correct 393 ms 293688 KB Output is correct
47 Correct 398 ms 293700 KB Output is correct
48 Correct 408 ms 293568 KB Output is correct
49 Correct 345 ms 278572 KB Output is correct
50 Correct 188 ms 232336 KB Output is correct
51 Correct 393 ms 293712 KB Output is correct
52 Correct 201 ms 235084 KB Output is correct