oj.uz

Submission #450343

# Submission time Handle Problem Language Result Execution time Memory
450343 2021-08-02T15:08:21 Z JovanB Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 671 ms 386072 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#include "boxes.h"
 
ll niz1[10000005];
ll dp1[10000005];
ll niz2[10000005];
ll dp2[10000005];
ll n;
 
long long delivery(int N, int K, int L, int p[]){
    ll l = L;
    ll k = K;
    n = N;
    for(ll i=0; i<N; i++){
        if(!p[i]) continue;
        niz1[i+1] = p[i];
        niz2[i+1] = p[i];
    }
    reverse(niz2+1, niz2+n+1);
    ll cost = 0;
    ll lcost = 0;
    for(ll i=n; i>=1; i-=k){
        lcost += 2*niz1[i];
    }
    cost = lcost;
    for(int i=1; i<=n; i++){
        if(i-k >= 0) dp1[i] += dp1[i-k];
        dp1[i] += 2*niz1[i];
    }
    for(int i=1; i<=n; i++){
        if(i-k >= 0) dp2[i] += dp2[i-k];
        dp2[i] += 2*(l-niz2[i]);
    }
    for(int i=0; i<=n; i++){
        int ost = n-k-i;
        if(ost >= 0) cost = min(cost, l+dp1[i]+dp2[ost]);
        cost = min(cost, dp1[i]+dp2[n-i]);
    }
    return min(cost, lcost);
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:38:22: warning: conversion from 'll' {aka 'long long int'} to 'int' may change value [-Wconversion]
   38 |         int ost = n-k-i;
      |                   ~~~^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 66 ms 45116 KB Output is correct
34 Correct 32 ms 35932 KB Output is correct
35 Correct 36 ms 37528 KB Output is correct
36 Correct 66 ms 45300 KB Output is correct
37 Correct 69 ms 45304 KB Output is correct
38 Correct 69 ms 45420 KB Output is correct
39 Correct 62 ms 43716 KB Output is correct
40 Correct 48 ms 39068 KB Output is correct
41 Correct 82 ms 45312 KB Output is correct
42 Correct 51 ms 39400 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 300 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 308 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 66 ms 45116 KB Output is correct
34 Correct 32 ms 35932 KB Output is correct
35 Correct 36 ms 37528 KB Output is correct
36 Correct 66 ms 45300 KB Output is correct
37 Correct 69 ms 45304 KB Output is correct
38 Correct 69 ms 45420 KB Output is correct
39 Correct 62 ms 43716 KB Output is correct
40 Correct 48 ms 39068 KB Output is correct
41 Correct 82 ms 45312 KB Output is correct
42 Correct 51 ms 39400 KB Output is correct
43 Correct 664 ms 385740 KB Output is correct
44 Correct 346 ms 356420 KB Output is correct
45 Correct 392 ms 360300 KB Output is correct
46 Correct 671 ms 386072 KB Output is correct
47 Correct 634 ms 386036 KB Output is correct
48 Correct 662 ms 386068 KB Output is correct
49 Correct 606 ms 380984 KB Output is correct
50 Correct 381 ms 364240 KB Output is correct
51 Correct 658 ms 386020 KB Output is correct
52 Correct 440 ms 365764 KB Output is correct