제출 #499385

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

sculpture

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

const int MAXN = 2077;
const ll INF = 1.77013e18;
ll a[MAXN];

signed main() {
    int n, A, B;
    cin >> n >> A >> B;
    for (int i = 0; i < n; ++i)
        cin >> a[i];
    ll ans = INF;
    for (int m = (1ll << (n - 1)); m < (1ll << n); ++m) {
        int cnt = __builtin_popcount(m);
        if (A > cnt || cnt > B)
            continue;
        ll sm = 0;
        ll ans_ = 0;
        for (int i = 0; i < n; ++i) {
            sm += a[i];
            if (m & (1 << i)) {
                ans_ |= sm;
                sm = 0;
            }
        }
        ans = min(ans, ans_);
    }
    if (ans == INF) {
        assert(0);
    }

    cout << ans << endl;
}

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