oj.uz

Submission #744191

# Submission time Handle Problem Language Result Execution time Memory
744191 2023-05-18T09:04:20 Z viwlesxq Bali Sculptures (APIO15_sculpture) C++17
25 / 100
 1000 ms 20260 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 + 1];
    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 if (n <= 100) {
        ll mask = 0;
        for (int bit = 60; bit >= 0; --bit) {
            bool can = false;
            mask |= 1ll << 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 ^= 1ll << bit;
            }
        }
        cout << (1ll << 61) - 1 - mask;
    } else {
        ll mask = 0;
        for (int bit = 60; bit >= 0; --bit) {
            mask |= 1ll << bit;
            vector <ll> dp(n + 1, inf);
            dp[0] = 0;
            for (int i = 0; i < n; ++i) {
                ll sum = 0;
                if (dp[i] < inf) {
                    for (int j = i; j < n; ++j) {
                        sum += y[j];
                        if ((sum & mask) == 0) {
                            dp[j] = min(dp[j], dp[i] + 1);
                        }
                    }
                }
            }
            if (dp[n] <= b) {
                mask ^= 1ll << bit;
            }
        }
        cout << (1ll << 61) - 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 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 212 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 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 30 ms 320 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 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 212 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 4 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 4 ms 308 KB Output is correct
26 Correct 28 ms 312 KB Output is correct
27 Correct 0 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 5 ms 212 KB Output is correct
32 Correct 2 ms 212 KB Output is correct
33 Correct 28 ms 212 KB Output is correct
34 Correct 31 ms 312 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 31 ms 312 KB Output is correct

Subtask #2
16.0 / 16.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 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 2 ms 212 KB Output is correct
9 Correct 3 ms 316 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 32 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 0 ms 212 KB Output is correct
18 Correct 0 ms 212 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 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 2 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 29 ms 304 KB Output is correct
27 Correct 9 ms 1256 KB Output is correct
28 Correct 8 ms 1620 KB Output is correct
29 Correct 8 ms 3284 KB Output is correct
30 Correct 42 ms 3912 KB Output is correct
31 Correct 86 ms 5392 KB Output is correct
32 Correct 58 ms 5332 KB Output is correct
33 Correct 3 ms 5332 KB Output is correct
34 Correct 58 ms 5380 KB Output is correct
35 Correct 51 ms 5332 KB Output is correct
36 Correct 45 ms 5392 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 1 ms 212 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 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 32 ms 212 KB Output is correct
14 Correct 11 ms 1236 KB Output is correct
15 Correct 8 ms 1620 KB Output is correct
16 Correct 8 ms 3284 KB Output is correct
17 Correct 33 ms 3924 KB Output is correct
18 Correct 60 ms 5380 KB Output is correct
19 Correct 55 ms 5380 KB Output is correct
20 Correct 4 ms 5312 KB Output is correct
21 Correct 53 ms 5380 KB Output is correct
22 Correct 53 ms 5384 KB Output is correct
23 Correct 28 ms 5384 KB Output is correct
24 Correct 58 ms 5588 KB Output is correct
25 Correct 46 ms 8836 KB Output is correct
26 Correct 162 ms 12520 KB Output is correct
27 Correct 497 ms 16864 KB Output is correct
28 Execution timed out 1030 ms 20180 KB Time limit exceeded
29 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 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 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 28 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 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 6 ms 328 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 4 ms 212 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 7 ms 316 KB Output is correct
26 Correct 27 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 2 ms 212 KB Output is correct
31 Correct 5 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 26 ms 212 KB Output is correct
34 Correct 29 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 29 ms 212 KB Output is correct
37 Correct 9 ms 1236 KB Output is correct
38 Correct 7 ms 1620 KB Output is correct
39 Correct 8 ms 3268 KB Output is correct
40 Correct 33 ms 3932 KB Output is correct
41 Correct 53 ms 5436 KB Output is correct
42 Correct 51 ms 5388 KB Output is correct
43 Correct 3 ms 5332 KB Output is correct
44 Correct 53 ms 5332 KB Output is correct
45 Correct 44 ms 5388 KB Output is correct
46 Correct 27 ms 5332 KB Output is correct
47 Correct 58 ms 5596 KB Output is correct
48 Correct 46 ms 8788 KB Output is correct
49 Correct 149 ms 12500 KB Output is correct
50 Correct 475 ms 16876 KB Output is correct
51 Execution timed out 1076 ms 20180 KB Time limit exceeded
52 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 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 280 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 3 ms 212 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 28 ms 316 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 5 ms 212 KB Output is correct
19 Correct 2 ms 212 KB Output is correct
20 Correct 26 ms 324 KB Output is correct
21 Correct 28 ms 320 KB Output is correct
22 Correct 2 ms 212 KB Output is correct
23 Correct 29 ms 212 KB Output is correct
24 Correct 14 ms 1264 KB Output is correct
25 Correct 7 ms 1620 KB Output is correct
26 Correct 8 ms 3284 KB Output is correct
27 Correct 33 ms 3940 KB Output is correct
28 Correct 60 ms 5332 KB Output is correct
29 Correct 56 ms 5332 KB Output is correct
30 Correct 3 ms 5332 KB Output is correct
31 Correct 54 ms 5388 KB Output is correct
32 Correct 45 ms 5388 KB Output is correct
33 Correct 26 ms 5332 KB Output is correct
34 Correct 58 ms 5588 KB Output is correct
35 Correct 48 ms 8716 KB Output is correct
36 Correct 185 ms 12512 KB Output is correct
37 Correct 562 ms 16868 KB Output is correct
38 Execution timed out 1079 ms 20260 KB Time limit exceeded
39 Halted 0 ms 0 KB -