제출 #499382

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

sculpture

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

const int MAXN = 2077;
ll a[MAXN];
ll minsg_[MAXN]; 
ll* minsg = minsg_ + 1;

signed main() {
    int n, A, B;
    cin >> n >> A >> B;
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    if (A == 1) {
        ll ans = 0;
        for (ll bt = 61; bt >= 0; --bt) {
            for (int i = 0; i < n; ++i)
                minsg[i] = MAXN;
            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)) {
                        minsg[i] = min(minsg[i], minsg[j - 1]);
                    }
                }
            }
            if (minsg[n - 1] > B) {
                ans |= (1 << bt);
            }
        }
        cout << ans << endl;
    } else {

    }
}

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