제출 #1038332

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1038332		stdfloat	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	87 ms	604 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define all(v) (v).begin(), (v).end()

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

    int n, A, B;
    cin >> n >> A >> B;

    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];

    if (A == 1) {
        ll ans = (1LL << 50) - 1;
        for (int z = 49; z >= 0; z--) {
            ans -= (1LL << z);

            ll sm = 0;
            vector<int> dp(n, INT_MAX);
            for (int i = 0; i < n; i++) {
                sm += a[i];

                if ((ans & sm) == sm) dp[i] = 0;
            
                ll sm = 0;
                for (int k = i; k > 0; k--) {
                    sm += a[k];

                    if (dp[k - 1] != INT_MAX && (ans & sm) == sm) dp[i] = min(dp[i], dp[k - 1] + 1);
                }
            }

            if (B <= dp[n - 1]) ans += 1LL << z;
        }

        return cout << ans, 0;
    }

    ll ans = (1LL << 50) - 1;
    for (int z = 49; z >= 0; z--) {
        ans -= (1LL << z);

        ll sm = 0;
        vector<vector<bool>> dp(n, vector<bool>(n));
        for (int i = 0; i < n; i++) {
            sm += a[i];

            if ((ans & sm) == sm) dp[i][0] = true;
        
            for (int j = 1; j < n; j++) {
                ll sm = 0;
                for (int k = i; k > 0; k--) {
                    sm += a[k];

                    if (dp[k - 1][j - 1] && (ans & sm) == sm) dp[i][j] = true;
                }
            }
        }

        if (!count(dp[n - 1].begin() + A - 1, dp[n - 1].begin() + B, true)) ans += 1LL << z;
    }

    cout << ans;
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 25 / 25
• Subtask 5: 29 / 29