oj.uz

Submission #1115597

# Submission time Handle Problem Language Result Execution time Memory
1115597 2024-11-20T16:43:52 Z staszic_ojuz Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 83 ms 139592 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

constexpr ll INF = 1e13 + 7;
constexpr int MAXN = 211;
ll dp[MAXN][MAXN][MAXN][2];

int main()
{
    int n, p;
    cin >> n >> p;
    vector<int> r;
    vector<int> l;
    vector<int> t;
    r.push_back(0);
    r.push_back(0);
    l.push_back(0);
    l.push_back(0);
    t.push_back(0);
    for(int i = 0; i < n; ++i)
    {
        int a;
        cin >> a;
        r.push_back(a);
    }
    for(int i = n+1; i >= 2; --i)
        l.push_back(p-r[i]);
    for(int i = 0; i < n; ++i)
    {
        int a;
        cin >> a;
        t.push_back(a);
    }
    t.push_back(0);
    for(int i = 0; i <= n+1; ++i)
    {
        for(int j = 0; j <= n+1; ++j)
        {
            for(int k = 0; k <= n; ++k)
            {
                dp[i][j][k][0] = INF;
                dp[i][j][k][1] = INF;
            }
        }
    }
    dp[1][1][0][0] = 0;
    dp[1][1][0][1] = 0;
    dp[0][1][0][0] = 0;
    dp[0][1][0][1] = 0;
    dp[1][0][0][0] = 0;
    dp[1][0][0][1] = 0;
    for(int i = 1; i <= n+1; ++i)
    {
        for(int j = 1; j <= n+1; ++j)
        {
            if(j+i > n+2)
                continue;
            for(int k = 0; k <= i+j-2; ++k)
            {
                if(k > 0)
                    dp[i][j][k][0] = min(dp[i-1][j][k-1][0] + l[i]-l[i-1], dp[i-1][j][k-1][1] + l[i]+r[j]);
                if(dp[i][j][k][0] > t[n-i+2])
                    dp[i][j][k][0] = min(dp[i-1][j][k][0] + l[i]-l[i-1], dp[i-1][j][k][1] + l[i]+r[j]);
                dp[i][j][k][0] = min(dp[i][j][k][0], INF);

                if(k > 0)
                    dp[i][j][k][1] = min(dp[i][j-1][k-1][1] + r[j]-r[j-1], dp[i][j-1][k-1][0] + l[i]+r[j]);
                if(dp[i][j][k][1] > t[j-1])
                    dp[i][j][k][1] = min(dp[i][j-1][k][1] + r[j]-r[j-1], dp[i][j-1][k][0] + l[i]+r[j]);
                dp[i][j][k][1] = min(dp[i][j][k][1], INF);
            }
        }
    }
    int odp = 0;
    for(int i = 1; i <= n+1; ++i)
    {
        for(int j = 1; j <= n+1; ++j)
        {
            for(int k = 1; k <= n; ++k)
            {
                for(int zj = 0; zj < 2; ++zj)
                {   
                    if(dp[i][j][k][zj] < INF)
                        odp = max(odp, k);
                }
            }
        }
    }
    cout << odp;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 2 ms 10576 KB Output is correct
7 Correct 1 ms 6624 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 3 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 1 ms 6480 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 10576 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 2 ms 10576 KB Output is correct
7 Correct 1 ms 6624 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 3 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 1 ms 6480 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 10576 KB Output is correct
18 Correct 2 ms 12624 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 2 ms 10576 KB Output is correct
21 Correct 2 ms 12624 KB Output is correct
22 Correct 2 ms 8528 KB Output is correct
23 Correct 2 ms 12624 KB Output is correct
24 Correct 2 ms 10576 KB Output is correct
25 Correct 2 ms 12624 KB Output is correct
26 Correct 2 ms 12624 KB Output is correct
27 Correct 1 ms 6480 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 12624 KB Output is correct
30 Correct 2 ms 12624 KB Output is correct
31 Correct 2 ms 12804 KB Output is correct
32 Correct 2 ms 10744 KB Output is correct
33 Correct 2 ms 12624 KB Output is correct
34 Correct 2 ms 12792 KB Output is correct
35 Correct 2 ms 12624 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 2 ms 10576 KB Output is correct
7 Correct 1 ms 6624 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 3 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 1 ms 6480 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 10576 KB Output is correct
18 Correct 52 ms 120392 KB Output is correct
19 Correct 29 ms 97104 KB Output is correct
20 Correct 13 ms 72444 KB Output is correct
21 Correct 23 ms 96848 KB Output is correct
22 Correct 34 ms 104412 KB Output is correct
23 Correct 12 ms 66128 KB Output is correct
24 Correct 10 ms 59984 KB Output is correct
25 Correct 10 ms 66128 KB Output is correct
26 Correct 7 ms 41608 KB Output is correct
27 Correct 11 ms 68344 KB Output is correct
28 Correct 9 ms 58088 KB Output is correct
29 Correct 12 ms 68340 KB Output is correct
30 Correct 9 ms 60100 KB Output is correct
31 Correct 10 ms 66128 KB Output is correct
32 Correct 7 ms 47696 KB Output is correct
33 Correct 12 ms 66128 KB Output is correct
34 Correct 6 ms 39504 KB Output is correct
35 Correct 12 ms 59984 KB Output is correct
36 Correct 7 ms 45816 KB Output is correct
37 Correct 11 ms 66492 KB Output is correct
38 Correct 7 ms 49744 KB Output is correct
39 Correct 13 ms 63824 KB Output is correct
40 Correct 8 ms 54008 KB Output is correct
41 Correct 83 ms 137240 KB Output is correct
42 Correct 64 ms 104460 KB Output is correct
43 Correct 81 ms 137800 KB Output is correct
44 Correct 47 ms 105040 KB Output is correct
45 Correct 78 ms 137576 KB Output is correct
46 Correct 40 ms 108872 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4432 KB Output is correct
2 Correct 1 ms 4432 KB Output is correct
3 Correct 2 ms 8528 KB Output is correct
4 Correct 1 ms 6480 KB Output is correct
5 Correct 2 ms 6480 KB Output is correct
6 Correct 2 ms 10576 KB Output is correct
7 Correct 1 ms 6624 KB Output is correct
8 Correct 2 ms 8528 KB Output is correct
9 Correct 2 ms 10576 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 3 ms 10576 KB Output is correct
13 Correct 2 ms 10576 KB Output is correct
14 Correct 1 ms 6480 KB Output is correct
15 Correct 1 ms 6480 KB Output is correct
16 Correct 2 ms 10576 KB Output is correct
17 Correct 2 ms 10576 KB Output is correct
18 Correct 2 ms 12624 KB Output is correct
19 Correct 2 ms 8528 KB Output is correct
20 Correct 2 ms 10576 KB Output is correct
21 Correct 2 ms 12624 KB Output is correct
22 Correct 2 ms 8528 KB Output is correct
23 Correct 2 ms 12624 KB Output is correct
24 Correct 2 ms 10576 KB Output is correct
25 Correct 2 ms 12624 KB Output is correct
26 Correct 2 ms 12624 KB Output is correct
27 Correct 1 ms 6480 KB Output is correct
28 Correct 2 ms 8540 KB Output is correct
29 Correct 2 ms 12624 KB Output is correct
30 Correct 2 ms 12624 KB Output is correct
31 Correct 2 ms 12804 KB Output is correct
32 Correct 2 ms 10744 KB Output is correct
33 Correct 2 ms 12624 KB Output is correct
34 Correct 2 ms 12792 KB Output is correct
35 Correct 2 ms 12624 KB Output is correct
36 Correct 52 ms 120392 KB Output is correct
37 Correct 29 ms 97104 KB Output is correct
38 Correct 13 ms 72444 KB Output is correct
39 Correct 23 ms 96848 KB Output is correct
40 Correct 34 ms 104412 KB Output is correct
41 Correct 12 ms 66128 KB Output is correct
42 Correct 10 ms 59984 KB Output is correct
43 Correct 10 ms 66128 KB Output is correct
44 Correct 7 ms 41608 KB Output is correct
45 Correct 11 ms 68344 KB Output is correct
46 Correct 9 ms 58088 KB Output is correct
47 Correct 12 ms 68340 KB Output is correct
48 Correct 9 ms 60100 KB Output is correct
49 Correct 10 ms 66128 KB Output is correct
50 Correct 7 ms 47696 KB Output is correct
51 Correct 12 ms 66128 KB Output is correct
52 Correct 6 ms 39504 KB Output is correct
53 Correct 12 ms 59984 KB Output is correct
54 Correct 7 ms 45816 KB Output is correct
55 Correct 11 ms 66492 KB Output is correct
56 Correct 7 ms 49744 KB Output is correct
57 Correct 13 ms 63824 KB Output is correct
58 Correct 8 ms 54008 KB Output is correct
59 Correct 83 ms 137240 KB Output is correct
60 Correct 64 ms 104460 KB Output is correct
61 Correct 81 ms 137800 KB Output is correct
62 Correct 47 ms 105040 KB Output is correct
63 Correct 78 ms 137576 KB Output is correct
64 Correct 40 ms 108872 KB Output is correct
65 Correct 58 ms 129352 KB Output is correct
66 Correct 55 ms 124552 KB Output is correct
67 Correct 44 ms 121168 KB Output is correct
68 Correct 38 ms 116408 KB Output is correct
69 Correct 50 ms 129356 KB Output is correct
70 Correct 46 ms 126616 KB Output is correct
71 Correct 45 ms 127828 KB Output is correct
72 Correct 46 ms 128336 KB Output is correct
73 Correct 44 ms 123728 KB Output is correct
74 Correct 40 ms 119112 KB Output is correct
75 Correct 53 ms 125220 KB Output is correct
76 Correct 57 ms 135496 KB Output is correct
77 Correct 54 ms 135456 KB Output is correct
78 Correct 37 ms 117344 KB Output is correct
79 Correct 39 ms 119640 KB Output is correct
80 Correct 54 ms 133452 KB Output is correct
81 Correct 42 ms 119388 KB Output is correct
82 Correct 45 ms 123468 KB Output is correct
83 Correct 60 ms 138792 KB Output is correct
84 Correct 46 ms 126800 KB Output is correct
85 Correct 61 ms 132692 KB Output is correct
86 Correct 62 ms 130888 KB Output is correct
87 Correct 52 ms 124784 KB Output is correct
88 Correct 81 ms 139592 KB Output is correct
89 Correct 67 ms 139584 KB Output is correct
90 Correct 51 ms 125256 KB Output is correct
91 Correct 65 ms 139400 KB Output is correct
92 Correct 60 ms 139572 KB Output is correct
93 Correct 61 ms 137808 KB Output is correct