제출 #499387

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499387		Stickfish	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	242 ms	336 KiB

sculpture

#include <iostream>
#include <bitset>
using namespace std;
using ll = long long;

const int MAXN = 2077;
ll a[MAXN];
ll minsg_[MAXN]; 
ll* minsg = minsg_ + 1;
bitset<MAXN> possg_[MAXN];
bitset<MAXN>* possg = possg_ + 1;

signed main() {
    int n, A, B;
    cin >> n >> A >> B;
    for (int i = 0; i < n; ++i) 
        cin >> a[i];
    ll ans = 0;
    for (ll bt = 61; bt >= 0; --bt) {
        for (int i = 0; i < n; ++i) {
            if (A == 1)
                minsg[i] = MAXN;
            else
                possg[i] = 0;
        }
        possg[-1][0] = 1;
        for (int i = 0; i < n; ++i) {
            ll sm = 0;
            for (int j = i; j >= 0; --j) {
                sm += a[j];
                if ((sm - (sm & ans)) < (1ll << bt)) {
                    if (A == 1) {
                        minsg[i] = min(minsg[i], minsg[j - 1] + 1);
                    } else {
                        possg[i] |= possg[j - 1] << 1;
                    }
                }
            }
        }
        if (A == 1) {
            if (minsg[n - 1] > B) {
                ans |= (1ll << bt);
            }
        } else {
            bool isok = false;
            for (int t = A; t <= B && !isok; ++t) {
                if (possg[n - 1][t])
                    isok = true;
            }
            if (!isok) {
                ans |= (1ll << bt);
            }
        }
    }
    cout << ans << endl;
}

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