oj.uz

Submission #748004

# Submission time Handle Problem Language Result Execution time Memory
748004 2023-05-25T09:30:25 Z Abrar_Al_Samit Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 599 ms 332916 KB 
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
 
const int nax = 1e7 + 3;
const long long INF = 1e18;
 
 
long long dp[nax];
int n, k, L;
int a[nax]; 
int c[nax];
int assoc[nax];

long long delivery(int N, int K, int l, int p[]) {
    n = N, k = K, L = l;
    for(int i=1; i<=n; ++i) {
        a[i] = p[i-1];
        c[i] = min(a[i], L-a[i]);
    }

    for(int i=1; i<n; ++i) {
        if(a[i+1]-a[i]>L/2) {
            assoc[i] = a[i+1] - c[i] - c[i+1];
        } else {
            assoc[i] = a[i];
        }
    }
 
    for(int i=1; i<=n+1; ++i) {
        dp[i] = INF;
    }
    dp[1] = c[1];
        

    deque<pair<int, long long>>dq;
    for(int i=2; i<=n; ++i) {
        //erase from window
        if(!dq.empty() && dq.front().first<i-k) {
            dq.pop_front();
        }

        if(!dq.empty()) {
            dp[i] = dq.front().second;
            dp[i] += c[i-1] + c[i] + a[i-1];
        }

        dp[i] = min(dp[i], dp[i-1] + c[i-1] + c[i]);

        //insert to window
        while(!dq.empty() && dq.back().second>=dp[i-1]-assoc[i-1]) {
            dq.pop_back();
        }
        dq.push_back(make_pair(i-1, dp[i-1] - assoc[i-1]));
    }
 

    long long ans = INF;
    for(int i=1; i<=n; ++i) {
        if(i+k-1>=n) {
            ans = min(ans, a[n]-a[i]+dp[i]+c[n]);
        }
    }
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 52 ms 23804 KB Output is correct
34 Correct 24 ms 23764 KB Output is correct
35 Correct 30 ms 23764 KB Output is correct
36 Correct 53 ms 23700 KB Output is correct
37 Correct 56 ms 23804 KB Output is correct
38 Correct 52 ms 23744 KB Output is correct
39 Correct 51 ms 23756 KB Output is correct
40 Correct 37 ms 23756 KB Output is correct
41 Correct 55 ms 23736 KB Output is correct
42 Correct 31 ms 23744 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 52 ms 23804 KB Output is correct
34 Correct 24 ms 23764 KB Output is correct
35 Correct 30 ms 23764 KB Output is correct
36 Correct 53 ms 23700 KB Output is correct
37 Correct 56 ms 23804 KB Output is correct
38 Correct 52 ms 23744 KB Output is correct
39 Correct 51 ms 23756 KB Output is correct
40 Correct 37 ms 23756 KB Output is correct
41 Correct 55 ms 23736 KB Output is correct
42 Correct 31 ms 23744 KB Output is correct
43 Correct 529 ms 251636 KB Output is correct
44 Correct 252 ms 254700 KB Output is correct
45 Correct 286 ms 262620 KB Output is correct
46 Correct 578 ms 332916 KB Output is correct
47 Correct 599 ms 332760 KB Output is correct
48 Correct 580 ms 332812 KB Output is correct
49 Correct 542 ms 327972 KB Output is correct
50 Correct 331 ms 271512 KB Output is correct
51 Correct 596 ms 331460 KB Output is correct
52 Correct 380 ms 273912 KB Output is correct