Submission #609581

#	Time	Username	Problem	Language	Result	Execution time	Memory
609581		Jomnoi	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	100 ms	588 KiB

sculpture

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

const int MAX_N = 2005;
const int INF = 1e9 + 7;
const long long llINF = 1e18 + 7;

int Y[MAX_N];
long long qs[MAX_N];
int dp[MAX_N];
bool dp2[MAX_N][MAX_N];

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    int N, A, B;
    cin >> N >> A >> B;

    for(int i = 1; i <= N; i++) {
        cin >> Y[i];

        qs[i] = qs[i - 1] + Y[i];
    }

    long long ans = (1ll<<41) - 1;
    if(A != 1) {
        for(int b = 40; b >= 0; b--) {
            ans ^= (1ll<<b);
            for(int k = 0; k <= N; k++) {
                for(int i = 0; i <= N; i++) {
                    dp2[k][i] = false;
                }
            }

            dp2[0][0] = true;
            for(int k = 1; k <= N; k++) {
                for(int i = k; i <= N; i++) {
                    for(int j = i; j >= 1; j--) {
                        if(((qs[i] - qs[j - 1]) | ans) == ans) {
                            dp2[k][i] |= dp2[k - 1][j - 1];
                        }
                    }
                }
            }

            bool ok = false;
            for(int x = A; x <= B; x++) {
                ok |= dp2[x][N];
            }

            if(ok == false) {
                ans ^= (1ll<<b);
            }
        }
    }
    else {
        for(int b = 40; b >= 0; b--) {
            ans ^= (1ll<<b);
            for(int i = 1; i <= N; i++) {
                long long sum = 0;
                dp[i] = INF;
                for(int j = i; j >= 1; j--) {
                    sum += Y[j];
                    if((sum | ans) == ans) {
                        dp[i] = min(dp[i], dp[j - 1] + 1);
                    }
                }
            }

            if(dp[N] > B) {
                ans ^= (1ll<<b);
            }
        }
    }
    cout << ans;
    return 0;
}

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