Submission #227412

#	Time	Username	Problem	Language	Result	Execution time	Memory
227412		shafinalam	Bali Sculptures (APIO15_sculpture)	C++14	21 / 100	22 ms	31872 KiB

sculpture

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int mxn = 2005;

ll n, A, B;
ll arr[mxn];
ll pre[mxn];
ll dp[mxn][mxn];
ll last = pow(2,50);
ll solve(int pos, int k)
{
    if(pos>n)
    {
        if(k>=A && k<=B) return 0;
        return last;
    }
    if(dp[pos][k]!=-1) return dp[pos][k];
    ll ret = last;
    //cout << ret << '\n';
    for(int i = pos; i <= n; i++)
    {
        ll tmp = solve(i+1, k+1);
        if(tmp==last) ret = tmp;
        else ret = min(ret, tmp|(pre[i]-pre[pos-1]));
    }
    //cout << ret << '\n';
    return dp[pos][k] = ret;
}
int main()
{
    //cout << last << '\n';
    cin >> n >> A >> B;


    for(int i = 1; i <= n; i++) cin >> arr[i];
    for(int i = 1; i <= n; i++) pre[i] = pre[i-1]+arr[i];
    memset(dp, -1, sizeof dp);
    ll ans = solve(1, 0);
    cout << ans << '\n';
    return 0;
}

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