Submission #110625

#TimeUsernameProblemLanguageResultExecution timeMemory
110625dwikBali Sculptures (APIO15_sculpture)C++11
21 / 100
24 ms1168 KiB
#include <bits/stdc++.h>
using namespace std;
int n,a,b;
int arr[109];
int dp[109][2009];
int main(){
    cin>>n>>a>>b;
    for(int i=1;i<=n;i++){
        cin>>arr[i];

    }
    for(int j=0;j<=n;j++)
        for(int i=0;i<=2000;i++){
            dp[j][i]=1000000009;
        }
    dp[0][0] = 0;
    for(int i=1;i<=n;i++){
        int sum = 0;
        for(int j=i;j>=1;j--){
            sum += arr[j];
            for(int k=0;k<=2000;k++){
                dp[i][sum|k] = min(dp[i][sum|k],dp[j-1][k]+1);
            }    
        }
    }
    for(int i=0;i<=2000;i++){
        if(dp[n][i]<=b){
            cout<<i<<endl;
            exit(0);
        }
        
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...