Submission #137440

#	Time	Username	Problem	Language	Result	Execution time	Memory
137440		shafinalam	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	455 ms	476 KiB

sculpture

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const int mxn = 30;
ll arr[mxn];
ll pre[mxn];

int main()
{
    int n, a, b;
    cin >> n;
    cin >> a >> b;

    for(int i = 0; i < n; i++) cin >> arr[i];

    pre[0] = arr[0];
    for(int i = 1; i < n; i++) pre[i] = arr[i]+pre[i-1];
    ll lim = (1<<n)-1;
    ll res = LLONG_MAX;
    for(int i = 0; i < lim; i++)
    {
        int cnt = __builtin_popcount(i)+1;
        if(cnt<a || cnt>b) continue;
        ll ans = 0, last = -1;
        for(int r = 0; r < n; r++)
        {
            ll sum = 0;
            if(i&(1<<r) || r==n-1)
            {
                if(last==-1) sum = pre[r];
                else sum = pre[r]-pre[last];
                last = r;
                ans = ans|sum;
            }
        }
        res = min(res, ans);
    }
    cout << res << '\n';
    return 0;
}

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