oj.uz

답안 #744164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
744164 2023-05-18T08:51:44 Z viwlesxq Bali Sculptures (APIO15_sculpture) C++17
46 / 100
 880 ms 20292 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 += dp[k][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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 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 316 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 3 ms 320 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 31 ms 300 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 1 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 4 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 31 ms 212 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 5 ms 212 KB Output is correct
32 Correct 2 ms 320 KB Output is correct
33 Correct 31 ms 212 KB Output is correct
34 Correct 36 ms 300 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 34 ms 212 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 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 320 KB Output is correct
10 Correct 2 ms 320 KB Output is correct
11 Correct 2 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 34 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 316 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 324 KB Output is correct
19 Correct 1 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 5 ms 324 KB Output is correct
22 Correct 5 ms 340 KB Output is correct
23 Correct 5 ms 212 KB Output is correct
24 Correct 3 ms 212 KB Output is correct
25 Correct 7 ms 212 KB Output is correct
26 Correct 30 ms 212 KB Output is correct
27 Correct 7 ms 1236 KB Output is correct
28 Correct 6 ms 1600 KB Output is correct
29 Correct 6 ms 3284 KB Output is correct
30 Correct 24 ms 3924 KB Output is correct
31 Correct 42 ms 5388 KB Output is correct
32 Correct 40 ms 5388 KB Output is correct
33 Correct 3 ms 5332 KB Output is correct
34 Correct 50 ms 5392 KB Output is correct
35 Correct 43 ms 5396 KB Output is correct
36 Correct 20 ms 5408 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 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 320 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 320 KB Output is correct
12 Correct 2 ms 320 KB Output is correct
13 Correct 31 ms 212 KB Output is correct
14 Correct 7 ms 1236 KB Output is correct
15 Correct 5 ms 1620 KB Output is correct
16 Correct 6 ms 3284 KB Output is correct
17 Correct 28 ms 3940 KB Output is correct
18 Correct 54 ms 5332 KB Output is correct
19 Correct 35 ms 5332 KB Output is correct
20 Correct 3 ms 5312 KB Output is correct
21 Correct 38 ms 5332 KB Output is correct
22 Correct 31 ms 5384 KB Output is correct
23 Correct 19 ms 5408 KB Output is correct
24 Correct 40 ms 5588 KB Output is correct
25 Correct 35 ms 8844 KB Output is correct
26 Correct 152 ms 12512 KB Output is correct
27 Correct 342 ms 16884 KB Output is correct
28 Correct 779 ms 20276 KB Output is correct
29 Correct 713 ms 20268 KB Output is correct
30 Correct 11 ms 20292 KB Output is correct
31 Correct 365 ms 20268 KB Output is correct
32 Correct 601 ms 20268 KB Output is correct

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 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 320 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 3 ms 212 KB Output is correct
10 Correct 4 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 31 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 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 212 KB Output is correct
19 Correct 1 ms 316 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 4 ms 212 KB Output is correct
22 Correct 5 ms 212 KB Output is correct
23 Correct 7 ms 340 KB Output is correct
24 Correct 2 ms 212 KB Output is correct
25 Correct 5 ms 212 KB Output is correct
26 Correct 34 ms 296 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 1 ms 316 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 320 KB Output is correct
32 Correct 2 ms 212 KB Output is correct
33 Correct 29 ms 304 KB Output is correct
34 Correct 31 ms 212 KB Output is correct
35 Correct 2 ms 212 KB Output is correct
36 Correct 33 ms 300 KB Output is correct
37 Correct 7 ms 1216 KB Output is correct
38 Correct 6 ms 1620 KB Output is correct
39 Correct 6 ms 3284 KB Output is correct
40 Correct 30 ms 3924 KB Output is correct
41 Correct 42 ms 5384 KB Output is correct
42 Correct 37 ms 5312 KB Output is correct
43 Correct 3 ms 5332 KB Output is correct
44 Correct 41 ms 5332 KB Output is correct
45 Correct 35 ms 5332 KB Output is correct
46 Correct 20 ms 5408 KB Output is correct
47 Correct 54 ms 5604 KB Output is correct
48 Correct 40 ms 8788 KB Output is correct
49 Correct 118 ms 12500 KB Output is correct
50 Correct 356 ms 16872 KB Output is correct
51 Correct 880 ms 20268 KB Output is correct
52 Correct 806 ms 20268 KB Output is correct
53 Correct 13 ms 20180 KB Output is correct
54 Correct 391 ms 20268 KB Output is correct
55 Correct 552 ms 20180 KB Output is correct
56 Incorrect 3 ms 212 KB Output isn't correct
57 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 316 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 0 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 3 ms 212 KB Output is correct
12 Correct 2 ms 212 KB Output is correct
13 Correct 33 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 316 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 316 KB Output is correct
19 Correct 2 ms 320 KB Output is correct
20 Correct 29 ms 212 KB Output is correct
21 Correct 31 ms 212 KB Output is correct
22 Correct 2 ms 320 KB Output is correct
23 Correct 31 ms 212 KB Output is correct
24 Correct 6 ms 1236 KB Output is correct
25 Correct 7 ms 1648 KB Output is correct
26 Correct 6 ms 3296 KB Output is correct
27 Correct 24 ms 3904 KB Output is correct
28 Correct 39 ms 5332 KB Output is correct
29 Correct 37 ms 5332 KB Output is correct
30 Correct 3 ms 5316 KB Output is correct
31 Correct 43 ms 5388 KB Output is correct
32 Correct 32 ms 5332 KB Output is correct
33 Correct 18 ms 5408 KB Output is correct
34 Correct 39 ms 5588 KB Output is correct
35 Correct 36 ms 8840 KB Output is correct
36 Correct 109 ms 12500 KB Output is correct
37 Correct 363 ms 16864 KB Output is correct
38 Correct 825 ms 20268 KB Output is correct
39 Correct 732 ms 20272 KB Output is correct
40 Correct 10 ms 20240 KB Output is correct
41 Correct 375 ms 20272 KB Output is correct
42 Correct 610 ms 20272 KB Output is correct
43 Incorrect 2 ms 212 KB Output isn't correct
44 Halted 0 ms 0 KB -