Submission #1028528

#	Time	Username	Problem	Language	Result	Execution time	Memory
1028528		vjudge1	Bali Sculptures (APIO15_sculpture)	C++17	46 / 100	1044 ms	262144 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 2005;
int n, x, y;
ll a[N];
set<ll> dp[N][N];

int main(){
    cin >> n >> x >> y;
    for (int i = 1; i <= n; i ++)
        cin >> a[i], a[i] += a[i - 1], dp[i][1] = {a[i]};

    for (int j = 2; j <= n; j ++){
        for (int i = j; i <= n; i ++){
            for (int k = j - 1; k < i; k ++){
                for (ll val : dp[k][j - 1]){
                    dp[i][j].insert(val | (a[i] - a[k]));
                }
            }
        }
    }

    ll ans = 1e18;
    for (int i = x; i <= y; i ++)
        ans = min(ans, *dp[n][i].begin());
    cout << ans << endl;
}

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