oj.uz

Submission #98560

# Submission time Handle Problem Language Result Execution time Memory
98560 2019-02-24T09:54:25 Z someone_aa Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 911 ms 286380 KB 
#include <bits/stdc++.h>
//#include "boxes.h"
#define ll long long
#define pb push_back
#define mp make_pair
#define P pair<ll, ll>
using namespace std;
const int maxn = 10000100;
ll dp[maxn], n, k, l;
int arr[maxn];

long long delivery(int N, int K, int L, int p[]) {
    for(int i=0;i<N;i++) {
        arr[i+1] = p[i];
    }
    n = N; k = K; l = L;
    deque<P>dq1, dq2;

    dq1.pb(mp(0, 0));
    dq2.pb(mp(2LL * (l - arr[1]), 0));
    for(int i=1;i<=n;i++) {
        // solve for prefix of size i

        ll f = dq1.front().first;
        ll s = dq2.front().first;
        dp[i] = min(f + min(l, 2LL*arr[i]), s);

        while(dq1.size() > 0 && dq1.back().first >= dp[i]) {
            dq1.pop_back();
        }
        dq1.push_back(mp(dp[i], i));

        while(dq2.size() > 0 && dq2.back().first >= dp[i] + 2LL * (l - arr[i+1])) {
            dq2.pop_back();
        }
        dq2.push_back(mp(dp[i] + 2LL*(l-arr[i+1]), i));

        // check firsts

        if(dq1.front().second == i-k) dq1.pop_front();
        if(dq2.front().second == i-k) dq2.pop_front();
    }
    return dp[n];
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 80 ms 16044 KB Output is correct
34 Correct 56 ms 18028 KB Output is correct
35 Correct 60 ms 18452 KB Output is correct
36 Correct 87 ms 25720 KB Output is correct
37 Correct 94 ms 25816 KB Output is correct
38 Correct 97 ms 25768 KB Output is correct
39 Correct 80 ms 24404 KB Output is correct
40 Correct 60 ms 19704 KB Output is correct
41 Correct 83 ms 25820 KB Output is correct
42 Correct 64 ms 19964 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 356 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 3 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 2 ms 384 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct
33 Correct 80 ms 16044 KB Output is correct
34 Correct 56 ms 18028 KB Output is correct
35 Correct 60 ms 18452 KB Output is correct
36 Correct 87 ms 25720 KB Output is correct
37 Correct 94 ms 25816 KB Output is correct
38 Correct 97 ms 25768 KB Output is correct
39 Correct 80 ms 24404 KB Output is correct
40 Correct 60 ms 19704 KB Output is correct
41 Correct 83 ms 25820 KB Output is correct
42 Correct 64 ms 19964 KB Output is correct
43 Correct 911 ms 286380 KB Output is correct
44 Correct 526 ms 176524 KB Output is correct
45 Correct 526 ms 184256 KB Output is correct
46 Correct 757 ms 254972 KB Output is correct
47 Correct 739 ms 254904 KB Output is correct
48 Correct 775 ms 254948 KB Output is correct
49 Correct 763 ms 253312 KB Output is correct
50 Correct 555 ms 193272 KB Output is correct
51 Correct 780 ms 254712 KB Output is correct
52 Correct 522 ms 196216 KB Output is correct