제출 #1327532

#제출 시각아이디문제언어결과실행 시간메모리
1327532Ekber_EkberBali Sculptures (APIO15_sculpture)C++20
37 / 100
8 ms460 KiB
#include <bits/stdc++.h>
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define endl "\n"
#define ff first
#define ss second
#define pb push_back
#define all(v) v.begin(), v.end()
using namespace std;

constexpr int MAX = 2e+5 + 1, INF = 2e+16, MOD = 1e+9 + 7, K = 31;

void _() {
    int n, a, b;
    cin >> n >> a >> b;
    vector <int> v(n);
    for (int &i : v) cin >> i;
    int res = (1LL << K) - 1;
    for (int z = K - 1; z >= 0; z--) {
        int mask = res - (1LL << z);
        vector <bitset <2001>> dp(n+1);
        dp[0][0] = 1;
        for (int i = 1; i <= n; i++) {
            int s = v[i-1];
            for (int j = i-1; j >= 0; j--) {
                if ((mask | s) == mask) {
                    dp[i] |= (dp[j] << 1);
                }
                if (j) s += v[j-1];
            }
        }
        bool ok = 0;
        for (int i = a; i <= b; i++) {
            ok |= dp[n][i];
        }
        if (ok) res = mask;
    }
    cout << res;
}

signed main() {

    GOOD_LUCK

    int tests=1;
    // cin >> tests;
    for (int i=1; i <= tests; i++) {
        _();
        cout << endl;
    }

    return 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...