Submission #381777

#TimeUsernameProblemLanguageResultExecution timeMemory
381777jlallas384Bali Sculptures (APIO15_sculpture)C++17
0 / 100
1 ms492 KiB
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dp[2005][2005];
ll pref[2005];

int main(){
    int n,l,u;
    cin >> n >> l >> u;
    vector<int> a(n);
    for(auto &x: a){
        cin >> x;
    }
    for(int i = 0; i <= n; i++){
        for(int j = 0; j <= n; j++){
            dp[i][j] = (ll) 1e18;
        }
    }
    dp[0][0] = 0;
    for(int i = 0; i < n; i++){
        pref[i+1] = pref[i] + a[i];
    }
    for(int i = 1; i <= n; i++){
        for(int k = 1; k <= n; k++){
            for(int j = 0; j < i; j++){
                dp[i][k] = min(dp[i][k],dp[j][k-1] | (pref[i] - pref[j]));
            }
        }
    }
    ll ans = 1e18;
    for(int i = l; i <= u; i++){
        ans = min(ans,dp[n][i]);
    }
    cout << ans << "\n";
}
#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...