oj.uz

Submission #129824

# Submission time Handle Problem Language Result Execution time Memory
129824 2019-07-13T09:58:20 Z DodgeBallMan Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 663 ms 337588 KB 
#include <bits/stdc++.h>
#include "boxes.h"

using namespace std;

const int N = 1e7 + 10;
long long ans = 1e18, dpr[N], dpl[N], n, k, l, p[N];

long long delivery( int N, int K, int L, int P[] ) {
    n = ( long long )N, k = ( long long )K, l = ( long long )L;
    for( int i = 1 ; i <= n ; i++ ) p[i] = ( long long )P[i-1];
    for( int i = 1 ; i <= n ; i++ ) dpr[i] = ( p[i] <= l / 2 ? p[i] * 2LL : l ) + dpr[max( 0LL, ( long long )i - k )];
    for( int i = n ; i >= 1 ; i-- ) dpl[i] = ( p[i] >= l / 2 ? ( l - p[i] ) * 2LL : l ) + dpl[min( n + 1, ( long long )i + k )];
    for( int i = 0 ; i <= n ; i++ ) ans = min( ans, dpr[i] + dpl[i+1] );
    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:9:50: warning: declaration of 'N' shadows a global declaration [-Wshadow]
 long long delivery( int N, int K, int L, int P[] ) {
                                                  ^
boxes.cpp:6:11: note: shadowed declaration is here
 const int N = 1e7 + 10;
           ^
boxes.cpp:13:18: warning: conversion to 'int' from 'long long int' may alter its value [-Wconversion]
     for( int i = n ; i >= 1 ; i-- ) dpl[i] = ( p[i] >= l / 2 ? ( l - p[i] ) * 2LL : l ) + dpl[min( n + 1, ( long long )i + k )];
                  ^

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 65 ms 27896 KB Output is correct
34 Correct 42 ms 27768 KB Output is correct
35 Correct 43 ms 27896 KB Output is correct
36 Correct 66 ms 27768 KB Output is correct
37 Correct 65 ms 27768 KB Output is correct
38 Correct 73 ms 27772 KB Output is correct
39 Correct 64 ms 27768 KB Output is correct
40 Correct 42 ms 27768 KB Output is correct
41 Correct 72 ms 27768 KB Output is correct
42 Correct 44 ms 27740 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 380 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 65 ms 27896 KB Output is correct
34 Correct 42 ms 27768 KB Output is correct
35 Correct 43 ms 27896 KB Output is correct
36 Correct 66 ms 27768 KB Output is correct
37 Correct 65 ms 27768 KB Output is correct
38 Correct 73 ms 27772 KB Output is correct
39 Correct 64 ms 27768 KB Output is correct
40 Correct 42 ms 27768 KB Output is correct
41 Correct 72 ms 27768 KB Output is correct
42 Correct 44 ms 27740 KB Output is correct
43 Correct 643 ms 274352 KB Output is correct
44 Correct 339 ms 293880 KB Output is correct
45 Correct 367 ms 301620 KB Output is correct
46 Correct 663 ms 313268 KB Output is correct
47 Correct 641 ms 312712 KB Output is correct
48 Correct 645 ms 337588 KB Output is correct
49 Correct 596 ms 330784 KB Output is correct
50 Correct 430 ms 310764 KB Output is correct
51 Correct 650 ms 307808 KB Output is correct
52 Correct 446 ms 313292 KB Output is correct