Submission #110285

#	Time	Username	Problem	Language	Result	Execution time	Memory
110285		tc_abd	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	418 ms	263168 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;
int n,a,b,arr[59];
int dp[59][509][70][25][2];
int bt(int id,int sum,int curr,int flag,bool flag2){
    if(id == n){
        if(flag < a || flag > b || !flag2) return 1000000009;
        return curr;
    }
    int &ret = dp[id][sum][curr][flag][flag2];
    if(ret != -1) return ret;
    ret = 1000000009;
    sum += arr[id];
    ret = min(ret,bt(id+1,sum,curr,flag,0));
    curr |= sum;
    ret = min(ret,bt(id+1,0,curr,flag+1,1));
    return ret;
}
int main(){
    cin>>n>>a>>b;
    for(int i=0;i<n;i++) cin>>arr[i];
    memset(dp,-1,sizeof(dp));
    cout<<bt(0,0,0,0,0)<<endl;
}

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