Submission #667179

#	Time	Username	Problem	Language	Result	Execution time	Memory
667179		Kahou	Bali Sculptures (APIO15_sculpture)	C++14	9 / 100	31 ms	340 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define endl '\n'
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;

const int N = 20;
int n, A, B;
ll Y[N];
ll ans;

void solve() {
    cin >> n >> A >> B;
    for (int i = 0; i < n; i++) {
        cin >> Y[i];
    }
    ans = 1e18;
    int M = (1<<(n-1));

    for (int mask = 0; mask < M; mask++) {
        if (__builtin_popcount(mask)+1 < A || __builtin_popcount(mask)+1 > B) continue;

        ll sm = 0;
        ll tmp = 0;
        for (int i = 0; i < n; i++) {
            sm += Y[i];
            if (mask>>i&1) {
                tmp |= sm;
                sm = 0;
            }
        }
        tmp |= sm;
        sm = 0;
        ans = min(ans, tmp);
    }
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    solve();
    return 0;
}

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