oj.uz

Submission #823243

# Submission time Handle Problem Language Result Execution time Memory
823243 2023-08-12T09:56:32 Z t6twotwo Tortoise (CEOI21_tortoise) C++17
48 / 100
 3000 ms 382696 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<int> L(N, -1), R(N, N);
    for (int i = 0; i < N; i++) {
        if (A[i] == -1) {
            L[i] = i;
        } else if (i) {
            L[i] = L[i - 1];
        }
        int j = N - i - 1;
        if (A[j] == -1) {
            R[j] = j;
        } else if (i) {
            R[j] = R[j + 1];
        }
    }
    int ans = 0;
    vector dp(2 * N + 1, vector<int>(N, -1e9));
    dp[0][0] = 0;
    for (int i = 0; i < N; i++) {
        if (A[i] == -1) {
            continue;
        }
        auto pd = dp;
        for (int j = 0; j <= 2 * N; j++) {
            for (int k = 0; k < N; k++) {
                if (pd[j][k] < 0) {
                    // continue;
                }
                for (int c = 1; c <= A[i]; c++) {
                    int t = 2 * (c - 1) * min(L[i] == -1 ? N : i - L[i], R[i] == N ? N : R[i] - i);
                    if (j + abs(i - k) + t > 2 * i) {
                        break;
                    }
                    ans = max(ans, pd[j][k] + c);
                    if (L[i] != -1) {
                        int p = j + abs(i - k) + t + i - L[i];
                        if (p <= 2 * N) {
                            dp[p][L[i]] = max(dp[p][L[i]], pd[j][k] + c);
                        }
                    }
                    if (R[i] != N) {
                        int p = j + abs(i - k) + t + R[i] - i;
                        if (p <= 2 * N) {
                            dp[p][R[i]] = max(dp[p][R[i]], pd[j][k] + c);
                        }
                    }
                }
            }
        }
    }
    ans = -ans;
    for (int i = 0; i < N; i++) {
        if (A[i] != -1) {
            ans += A[i];
        }
    }
    cout << ans << "\n";
    return 6/22;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 116 ms 1360 KB Output is correct
28 Correct 211 ms 1908 KB Output is correct
29 Correct 167 ms 1740 KB Output is correct
30 Correct 113 ms 1368 KB Output is correct
31 Correct 174 ms 1712 KB Output is correct
32 Correct 74 ms 1080 KB Output is correct
33 Correct 169 ms 1772 KB Output is correct
34 Correct 127 ms 1364 KB Output is correct
35 Correct 170 ms 1772 KB Output is correct
36 Correct 174 ms 1772 KB Output is correct
37 Correct 185 ms 1988 KB Output is correct
38 Correct 171 ms 1780 KB Output is correct
39 Correct 180 ms 1772 KB Output is correct
40 Correct 167 ms 1920 KB Output is correct
41 Correct 162 ms 1988 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 116 ms 1360 KB Output is correct
28 Correct 211 ms 1908 KB Output is correct
29 Correct 167 ms 1740 KB Output is correct
30 Correct 113 ms 1368 KB Output is correct
31 Correct 174 ms 1712 KB Output is correct
32 Correct 74 ms 1080 KB Output is correct
33 Correct 169 ms 1772 KB Output is correct
34 Correct 127 ms 1364 KB Output is correct
35 Correct 170 ms 1772 KB Output is correct
36 Correct 174 ms 1772 KB Output is correct
37 Correct 185 ms 1988 KB Output is correct
38 Correct 171 ms 1780 KB Output is correct
39 Correct 180 ms 1772 KB Output is correct
40 Correct 167 ms 1920 KB Output is correct
41 Correct 162 ms 1988 KB Output is correct
42 Correct 49 ms 996 KB Output is correct
43 Correct 63 ms 1024 KB Output is correct
44 Correct 101 ms 1236 KB Output is correct
45 Correct 163 ms 1820 KB Output is correct
46 Correct 69 ms 1308 KB Output is correct
47 Correct 67 ms 1240 KB Output is correct
48 Correct 168 ms 1384 KB Output is correct
49 Correct 103 ms 1536 KB Output is correct
50 Correct 743 ms 1560 KB Output is correct
51 Correct 782 ms 1780 KB Output is correct
52 Correct 295 ms 1080 KB Output is correct
53 Correct 1604 ms 1748 KB Output is correct
54 Correct 2475 ms 1752 KB Output is correct
55 Correct 942 ms 1452 KB Output is correct
56 Correct 169 ms 1684 KB Output is correct
57 Correct 128 ms 1028 KB Output is correct
58 Correct 330 ms 1780 KB Output is correct
59 Correct 191 ms 1376 KB Output is correct
60 Correct 610 ms 1460 KB Output is correct
61 Correct 206 ms 1516 KB Output is correct
62 Correct 358 ms 1552 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 116 ms 1360 KB Output is correct
28 Correct 211 ms 1908 KB Output is correct
29 Correct 167 ms 1740 KB Output is correct
30 Correct 113 ms 1368 KB Output is correct
31 Correct 174 ms 1712 KB Output is correct
32 Correct 74 ms 1080 KB Output is correct
33 Correct 169 ms 1772 KB Output is correct
34 Correct 127 ms 1364 KB Output is correct
35 Correct 170 ms 1772 KB Output is correct
36 Correct 174 ms 1772 KB Output is correct
37 Correct 185 ms 1988 KB Output is correct
38 Correct 171 ms 1780 KB Output is correct
39 Correct 180 ms 1772 KB Output is correct
40 Correct 167 ms 1920 KB Output is correct
41 Correct 162 ms 1988 KB Output is correct
42 Correct 49 ms 996 KB Output is correct
43 Correct 63 ms 1024 KB Output is correct
44 Correct 101 ms 1236 KB Output is correct
45 Correct 163 ms 1820 KB Output is correct
46 Correct 69 ms 1308 KB Output is correct
47 Correct 67 ms 1240 KB Output is correct
48 Correct 168 ms 1384 KB Output is correct
49 Correct 103 ms 1536 KB Output is correct
50 Correct 743 ms 1560 KB Output is correct
51 Correct 782 ms 1780 KB Output is correct
52 Correct 295 ms 1080 KB Output is correct
53 Correct 1604 ms 1748 KB Output is correct
54 Correct 2475 ms 1752 KB Output is correct
55 Correct 942 ms 1452 KB Output is correct
56 Correct 169 ms 1684 KB Output is correct
57 Correct 128 ms 1028 KB Output is correct
58 Correct 330 ms 1780 KB Output is correct
59 Correct 191 ms 1376 KB Output is correct
60 Correct 610 ms 1460 KB Output is correct
61 Correct 206 ms 1516 KB Output is correct
62 Correct 358 ms 1552 KB Output is correct
63 Execution timed out 3055 ms 382696 KB Time limit exceeded
64 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 116 ms 1360 KB Output is correct
28 Correct 211 ms 1908 KB Output is correct
29 Correct 167 ms 1740 KB Output is correct
30 Correct 113 ms 1368 KB Output is correct
31 Correct 174 ms 1712 KB Output is correct
32 Correct 74 ms 1080 KB Output is correct
33 Correct 169 ms 1772 KB Output is correct
34 Correct 127 ms 1364 KB Output is correct
35 Correct 170 ms 1772 KB Output is correct
36 Correct 174 ms 1772 KB Output is correct
37 Correct 185 ms 1988 KB Output is correct
38 Correct 171 ms 1780 KB Output is correct
39 Correct 180 ms 1772 KB Output is correct
40 Correct 167 ms 1920 KB Output is correct
41 Correct 162 ms 1988 KB Output is correct
42 Correct 49 ms 996 KB Output is correct
43 Correct 63 ms 1024 KB Output is correct
44 Correct 101 ms 1236 KB Output is correct
45 Correct 163 ms 1820 KB Output is correct
46 Correct 69 ms 1308 KB Output is correct
47 Correct 67 ms 1240 KB Output is correct
48 Correct 168 ms 1384 KB Output is correct
49 Correct 103 ms 1536 KB Output is correct
50 Correct 743 ms 1560 KB Output is correct
51 Correct 782 ms 1780 KB Output is correct
52 Correct 295 ms 1080 KB Output is correct
53 Correct 1604 ms 1748 KB Output is correct
54 Correct 2475 ms 1752 KB Output is correct
55 Correct 942 ms 1452 KB Output is correct
56 Correct 169 ms 1684 KB Output is correct
57 Correct 128 ms 1028 KB Output is correct
58 Correct 330 ms 1780 KB Output is correct
59 Correct 191 ms 1376 KB Output is correct
60 Correct 610 ms 1460 KB Output is correct
61 Correct 206 ms 1516 KB Output is correct
62 Correct 358 ms 1552 KB Output is correct
63 Execution timed out 3055 ms 382696 KB Time limit exceeded
64 Halted 0 ms 0 KB -