oj.uz

Submission #211772

# Submission time Handle Problem Language Result Execution time Memory
211772 2020-03-21T08:13:54 Z DS007 Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 172 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 2005;
int n, a, b;
int y[N], p[N];

void solveTestCase() {
    cin >> n >> a >> b;
    for (int i = 0; i < n; i++) cin >> y[i];

    p[0] = y[0];
    for (int i = 1; i < n; i++)
        p[i] = y[i] + p[i - 1];

    if (n > 100) {
        int ans = 0;
        for (int i = 45; i >= 0; i--) {
            int dp[n];
            fill(dp, dp + n, 1e14);
            int up = ans + (1ll << i);
            bool check = y[0] < up;
            if ((y[0] & (1ll << i)) == 0)
                dp[0] = 1;

            for (int j = 1; j < n; j++) {
                check = check && y[j] < up;
                if (p[j] < up && (p[j] | up) < up + (1ll << i) && (p[j] & (1ll << i)) == 0)
                    dp[j] = 1;

                for (int k = j - 1; k >= 0; k--) {
                    if ((p[j] - p[k + 1] + y[k + 1]) < up && ((p[j] - p[k + 1] + y[k + 1]) | up) < up + (1ll << i) &&
                        ((p[j] - p[k + 1] + y[k + 1]) & (1ll << i)) == 0)
                        dp[j] = min(dp[j], dp[k] + 1);
                }
            }

            if (!check || dp[n - 1] > b)
                ans = up;
        }

        cout << ans;
    } else {
        int ans = 0;
        for (int i = 45; i >= 0; i--) {
            bool dp[n + 1][n];
            memset(dp, 0, sizeof(dp));

            int up = ans + (1ll << i);
            bool check = y[0] < up;
            for (int j = 1; j < n; j++)
                check = check && y[j] < up;

            for (int j = 0; j < n; j++) {
                if (p[j] < up && (p[j] | up) < up + (1ll << i) && (p[j] & (1ll << i)) == 0)
                   dp[1][j] = true;
            }

            for (int j = 2; j <= n; j++) {
                for (int k = j - 1; k < n; k++) {
                    for (int l = k - 1; l >= 0; l--) {
                        if ((p[k] - p[l + 1] + y[l + 1]) < up && ((p[k] - p[l + 1] + y[l + 1]) | up) < up + (1ll << i) && ((p[k] - p[l + 1] + y[l + 1]) & (1ll << i)) == 0)
                            dp[j][k] = dp[j][k] || dp[j - 1][l];
                    }
                }
            }

            bool flag = false;
            for (int j = a; j <= b; j++) {
                if (dp[j][n - 1])
                    flag = true;
            }

            if (!check || !flag)
                ans = up;
        }

        cout << ans;
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int test = 1;
    //cin >> test;
    while (test--)
        solveTestCase();
}

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

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

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 4 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 5 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 5 ms 384 KB Output is correct
38 Correct 5 ms 384 KB Output is correct
39 Correct 6 ms 384 KB Output is correct
40 Correct 7 ms 384 KB Output is correct
41 Correct 9 ms 384 KB Output is correct
42 Correct 9 ms 384 KB Output is correct
43 Correct 9 ms 384 KB Output is correct
44 Correct 9 ms 384 KB Output is correct
45 Correct 9 ms 384 KB Output is correct
46 Correct 9 ms 384 KB Output is correct
47 Correct 9 ms 384 KB Output is correct
48 Correct 15 ms 384 KB Output is correct
49 Correct 22 ms 504 KB Output is correct
50 Correct 33 ms 384 KB Output is correct
51 Correct 42 ms 384 KB Output is correct
52 Correct 40 ms 384 KB Output is correct
53 Correct 42 ms 384 KB Output is correct
54 Correct 42 ms 384 KB Output is correct
55 Correct 43 ms 384 KB Output is correct
56 Correct 10 ms 384 KB Output is correct
57 Correct 22 ms 384 KB Output is correct
58 Correct 30 ms 384 KB Output is correct
59 Correct 42 ms 384 KB Output is correct
60 Correct 36 ms 384 KB Output is correct
61 Correct 39 ms 384 KB Output is correct
62 Correct 41 ms 384 KB Output is correct
63 Correct 40 ms 512 KB Output is correct
64 Correct 31 ms 384 KB Output is correct
65 Correct 10 ms 384 KB Output is correct
66 Correct 16 ms 384 KB Output is correct
67 Correct 23 ms 384 KB Output is correct
68 Correct 32 ms 384 KB Output is correct
69 Correct 41 ms 384 KB Output is correct
70 Correct 39 ms 384 KB Output is correct
71 Correct 42 ms 384 KB Output is correct
72 Correct 41 ms 384 KB Output is correct
73 Correct 42 ms 384 KB Output is correct
74 Correct 41 ms 384 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 512 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 5 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 5 ms 384 KB Output is correct
25 Correct 6 ms 384 KB Output is correct
26 Correct 8 ms 384 KB Output is correct
27 Correct 7 ms 384 KB Output is correct
28 Correct 9 ms 384 KB Output is correct
29 Correct 9 ms 384 KB Output is correct
30 Correct 9 ms 384 KB Output is correct
31 Correct 9 ms 384 KB Output is correct
32 Correct 9 ms 384 KB Output is correct
33 Correct 10 ms 512 KB Output is correct
34 Correct 10 ms 384 KB Output is correct
35 Correct 15 ms 384 KB Output is correct
36 Correct 23 ms 384 KB Output is correct
37 Correct 32 ms 396 KB Output is correct
38 Correct 41 ms 396 KB Output is correct
39 Correct 40 ms 384 KB Output is correct
40 Correct 42 ms 384 KB Output is correct
41 Correct 44 ms 384 KB Output is correct
42 Correct 41 ms 384 KB Output is correct
43 Correct 10 ms 384 KB Output is correct
44 Correct 23 ms 384 KB Output is correct
45 Correct 30 ms 384 KB Output is correct
46 Correct 38 ms 384 KB Output is correct
47 Correct 35 ms 384 KB Output is correct
48 Correct 38 ms 384 KB Output is correct
49 Correct 42 ms 504 KB Output is correct
50 Correct 41 ms 384 KB Output is correct
51 Correct 5 ms 384 KB Output is correct
52 Correct 18 ms 384 KB Output is correct
53 Correct 24 ms 384 KB Output is correct
54 Correct 44 ms 384 KB Output is correct
55 Correct 40 ms 384 KB Output is correct
56 Correct 131 ms 384 KB Output is correct
57 Correct 127 ms 384 KB Output is correct
58 Correct 124 ms 384 KB Output is correct
59 Correct 124 ms 384 KB Output is correct
60 Correct 172 ms 384 KB Output is correct
61 Correct 5 ms 384 KB Output is correct
62 Correct 24 ms 384 KB Output is correct
63 Correct 46 ms 384 KB Output is correct
64 Correct 38 ms 384 KB Output is correct
65 Correct 69 ms 384 KB Output is correct
66 Correct 100 ms 444 KB Output is correct
67 Correct 155 ms 384 KB Output is correct
68 Correct 138 ms 384 KB Output is correct
69 Correct 126 ms 444 KB Output is correct