oj.uz

Submission #770031

# Submission time Handle Problem Language Result Execution time Memory
770031 2023-06-30T17:05:59 Z teokakabadze Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 1396 ms 380108 KB 
#include "boxes.h"
#include<bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define ll long long
#define NN 10000007
#define pii pair<int, int>
using namespace std;

ll n, k, a[NN], dp[NN], dp1[NN], ans, i, l;
deque<pair<ll, ll> > d;

long long delivery(int N, int K, int L, int p[])
{
    n = N, k = K, l = L;
    for(i = 0; i < n; i++)
    a[i] = p[i];
    d.pb({0, -1});
    for(i = 0; i < n; i++)
    {
        if(d.front().s == i - k - 1) d.pop_front();
        dp[i] = min(l, 2 * a[i]) + d.front().f;
        while(d.size() && d.front().f >= dp[i]) d.pop_front();
        d.pb({dp[i], i});
    }
    while(d.size()) d.pop_back();
    d.pb({0, n});
    for(i = n - 1; i >= 0; i--)
    {
        if(d.front().s == i + k + 1) d.pop_front();
        dp1[i] = min(l, 2 * (L - a[i])) + d.front().f;
        while(d.size() && d.front().f >= dp1[i]) d.pop_front();
        d.pb({dp1[i], i});
    }
    ans = 1e18;
    for(i = 0; i < n; i++)
    ans = min(ans, dp[i] + dp1[(i + 1) % n]);
    return min(min(dp[n - 1], dp1[0]), ans);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 304 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 308 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 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 1 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 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 1 ms 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 304 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 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 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 1 ms 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 304 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 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 69 ms 37308 KB Output is correct
34 Correct 45 ms 29700 KB Output is correct
35 Correct 47 ms 30196 KB Output is correct
36 Correct 70 ms 37508 KB Output is correct
37 Correct 70 ms 37484 KB Output is correct
38 Correct 69 ms 37372 KB Output is correct
39 Correct 64 ms 35920 KB Output is correct
40 Correct 49 ms 31376 KB Output is correct
41 Correct 72 ms 37420 KB Output is correct
42 Correct 47 ms 31644 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 1 ms 312 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 304 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 308 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 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 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 69 ms 37308 KB Output is correct
34 Correct 45 ms 29700 KB Output is correct
35 Correct 47 ms 30196 KB Output is correct
36 Correct 70 ms 37508 KB Output is correct
37 Correct 70 ms 37484 KB Output is correct
38 Correct 69 ms 37372 KB Output is correct
39 Correct 64 ms 35920 KB Output is correct
40 Correct 49 ms 31376 KB Output is correct
41 Correct 72 ms 37420 KB Output is correct
42 Correct 47 ms 31644 KB Output is correct
43 Correct 750 ms 370464 KB Output is correct
44 Correct 404 ms 302108 KB Output is correct
45 Correct 430 ms 301624 KB Output is correct
46 Correct 727 ms 380108 KB Output is correct
47 Correct 920 ms 374532 KB Output is correct
48 Correct 1088 ms 369924 KB Output is correct
49 Correct 1062 ms 372480 KB Output is correct
50 Correct 671 ms 318800 KB Output is correct
51 Correct 1396 ms 374672 KB Output is correct
52 Correct 562 ms 319928 KB Output is correct