oj.uz

Submission #744173

# Submission time Handle Problem Language Result Execution time Memory
744173 2023-05-18T08:54:47 Z viwlesxq Bali Sculptures (APIO15_sculpture) C++17
46 / 100
 777 ms 20300 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef string str;

const ll inf = 1e18;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, a, b;
    cin >> n >> a >> b;
    ll y[n];
    for (int i = 0; i < n; ++i) {
        cin >> y[i];
    }
    if (n <= 20) {
        ll ans = inf;
        for (int mask = 0; mask < (1 << (n - 1)); ++mask) {
            int cnt = __builtin_popcount(mask) + 1;
            if (cnt < a || cnt > b) {
                continue;
            }
            ll cur = 0;
            ll sum = y[0];
            for (int bit = 0; bit < n - 1; ++bit) {
                if (mask & (1 << bit)) {
                    cur |= sum;
                    sum = y[bit + 1];
                } else {
                    sum += y[bit + 1];
                }
            }
            cur |= sum;
            ans = min(ans, cur);
        }
        cout << ans;
    } else if (*max_element(y, y + n) <= 20) {
        ll pref[n + 1];
        bool dp[n + 1][n + 1][2001];
        memset(dp, false, sizeof(dp));
        pref[0] = 0;
        for (int i = 1; i <= n; ++i) {
            pref[i] = pref[i - 1] + y[i - 1];
        }
        for (int i = 1; i <= n; ++i) {
            dp[i][1][pref[i]] = true; 
        }
        for (int k = 2; k <= b; ++k) {
            for (int i = 1; i <= n; ++i) {
                for (int j = i - 1; j >= 1; --j) {
                    for (int x = 0; x < 2001; ++x) {
                        if (dp[j][k - 1][x]) {
                            dp[i][k][x | (pref[i] - pref[j])] = true;
                        }
                    }
                }
            }
        }
        ll ans = inf;
        for (int k = a; k <= b; ++k) {
            for (int x = 0; x < 2001; ++x) {
                if (dp[n][k][x]) {
                    ans = min(ans, (ll)x);
                }
            }
        }
        cout << ans;
    } else {
        int mask = 0;
        for (int bit = 29; bit >= 0; --bit) {
            bool can = false;
            mask |= 1 << bit;
            vector <vector <bool>> dp(n + 1, vector <bool> (n + 1, false));
            dp[0][0] = true;
            for (int k = 0; k <= b; ++k) {
                for (int i = 0; i < n; ++i) {
                    ll sum = 0;
                    if (dp[k][i]) {
                        for (int j = i; j < n; ++j) {
                            sum += y[j];
                            if ((sum & mask) == 0) {
                                dp[k + 1][j + 1] = true;
                            }
                        }
                    }
                }
            }
            for (int k = a; k <= b; ++k) {
                if (dp[k][n]) {
                    can = true;
                }
            }
            if (!can) {
                mask ^= 1 << bit;
            }
        }
        cout << (1 << 30) - 1 - mask;
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 2 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 316 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 43 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 320 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 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 6 ms 212 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 5 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 36 ms 300 KB Output is correct
27 Correct 1 ms 264 KB Output is correct
28 Correct 1 ms 316 KB Output is correct
29 Correct 1 ms 320 KB Output is correct
30 Correct 2 ms 212 KB Output is correct
31 Correct 5 ms 324 KB Output is correct
32 Correct 2 ms 212 KB Output is correct
33 Correct 32 ms 300 KB Output is correct
34 Correct 36 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 34 ms 300 KB Output is correct

Subtask #2
16.0 / 16.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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 320 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 3 ms 320 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 316 KB Output is correct
13 Correct 37 ms 300 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 296 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 5 ms 316 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 5 ms 320 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 6 ms 212 KB Output is correct
26 Correct 29 ms 216 KB Output is correct
27 Correct 7 ms 1244 KB Output is correct
28 Correct 6 ms 1620 KB Output is correct
29 Correct 10 ms 3260 KB Output is correct
30 Correct 26 ms 3900 KB Output is correct
31 Correct 64 ms 5388 KB Output is correct
32 Correct 41 ms 5384 KB Output is correct
33 Correct 3 ms 5332 KB Output is correct
34 Correct 50 ms 5332 KB Output is correct
35 Correct 32 ms 5332 KB Output is correct
36 Correct 20 ms 5332 KB Output is correct

Subtask #3
21.0 / 21.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 212 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 316 KB Output is correct
8 Correct 3 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 212 KB Output is correct
11 Correct 3 ms 212 KB Output is correct
12 Correct 3 ms 212 KB Output is correct
13 Correct 33 ms 312 KB Output is correct
14 Correct 7 ms 1260 KB Output is correct
15 Correct 5 ms 1596 KB Output is correct
16 Correct 7 ms 3284 KB Output is correct
17 Correct 30 ms 3924 KB Output is correct
18 Correct 41 ms 5316 KB Output is correct
19 Correct 41 ms 5384 KB Output is correct
20 Correct 3 ms 5332 KB Output is correct
21 Correct 45 ms 5404 KB Output is correct
22 Correct 31 ms 5332 KB Output is correct
23 Correct 19 ms 5332 KB Output is correct
24 Correct 45 ms 5596 KB Output is correct
25 Correct 35 ms 8788 KB Output is correct
26 Correct 114 ms 12500 KB Output is correct
27 Correct 345 ms 16972 KB Output is correct
28 Correct 777 ms 20272 KB Output is correct
29 Correct 729 ms 20268 KB Output is correct
30 Correct 11 ms 20180 KB Output is correct
31 Correct 373 ms 20264 KB Output is correct
32 Correct 579 ms 20180 KB Output is correct

Subtask #4
0 / 25.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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 2 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 2 ms 324 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 32 ms 212 KB Output is correct
14 Correct 1 ms 212 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 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 5 ms 320 KB Output is correct
22 Correct 4 ms 324 KB Output is correct
23 Correct 5 ms 324 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 4 ms 316 KB Output is correct
26 Correct 29 ms 316 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 212 KB Output is correct
31 Correct 4 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 31 ms 212 KB Output is correct
34 Correct 35 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 31 ms 212 KB Output is correct
37 Correct 11 ms 1236 KB Output is correct
38 Correct 8 ms 1620 KB Output is correct
39 Correct 7 ms 3260 KB Output is correct
40 Correct 24 ms 3940 KB Output is correct
41 Correct 40 ms 5412 KB Output is correct
42 Correct 38 ms 5388 KB Output is correct
43 Correct 3 ms 5332 KB Output is correct
44 Correct 40 ms 5312 KB Output is correct
45 Correct 31 ms 5332 KB Output is correct
46 Correct 20 ms 5412 KB Output is correct
47 Correct 41 ms 5588 KB Output is correct
48 Correct 33 ms 8788 KB Output is correct
49 Correct 112 ms 12500 KB Output is correct
50 Correct 356 ms 16972 KB Output is correct
51 Correct 739 ms 20300 KB Output is correct
52 Correct 757 ms 20280 KB Output is correct
53 Correct 10 ms 20180 KB Output is correct
54 Correct 354 ms 20272 KB Output is correct
55 Correct 615 ms 20268 KB Output is correct
56 Incorrect 1 ms 212 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #5
0 / 29.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 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 3 ms 316 KB Output is correct
9 Correct 2 ms 212 KB Output is correct
10 Correct 3 ms 316 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 35 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 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 4 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 28 ms 212 KB Output is correct
21 Correct 32 ms 212 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 34 ms 212 KB Output is correct
24 Correct 7 ms 1236 KB Output is correct
25 Correct 5 ms 1620 KB Output is correct
26 Correct 6 ms 3284 KB Output is correct
27 Correct 25 ms 3924 KB Output is correct
28 Correct 36 ms 5332 KB Output is correct
29 Correct 35 ms 5332 KB Output is correct
30 Correct 3 ms 5332 KB Output is correct
31 Correct 36 ms 5332 KB Output is correct
32 Correct 31 ms 5312 KB Output is correct
33 Correct 19 ms 5404 KB Output is correct
34 Correct 41 ms 5592 KB Output is correct
35 Correct 34 ms 8788 KB Output is correct
36 Correct 115 ms 12516 KB Output is correct
37 Correct 387 ms 16880 KB Output is correct
38 Correct 733 ms 20264 KB Output is correct
39 Correct 759 ms 20276 KB Output is correct
40 Correct 12 ms 20288 KB Output is correct
41 Correct 439 ms 20272 KB Output is correct
42 Correct 580 ms 20268 KB Output is correct
43 Incorrect 1 ms 212 KB Output isn't correct
44 Halted 0 ms 0 KB -