Submission #897163

#	Time	Username	Problem	Language	Result	Execution time	Memory
897163		VMaksimoski008	Bali Sculptures (APIO15_sculpture)	C++14	0 / 100	1 ms	348 KiB

sculpture

#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int32_t main() {
    setIO();
    
    int N, A, B;
    cin >> N >> A >> B;
    vector<int> v(N+1);
    for(int i=1; i<=N; i++) cin >> v[i];

    vector<vector<ll> > dp(N+1, vector<ll>(B+1, 1e18));
    dp[0][0] = 0;

    for(int i=1; i<=N; i++) {
        for(int j=1; j<=B; j++) {
            ll sum = 0;
            for(int k=i; k>=1; k--) {
                sum += v[k];
                dp[i][j] = min(dp[i][j], dp[k-1][j-1] | sum);
            }
        }
    }

    ll ans = 1e18;
    for(int i=A; i<=B; i++)
        ans = min(ans, dp[N][i]);
    cout << ans << '\n';
    return 0;
}

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