제출 #1237735

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237735		tin_le	Bali Sculptures (APIO15_sculpture)	C++20	0 / 100	9 ms	16088 KiB

sculpture

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvll = vector<vll>;
#define INF 1e18
int dp[2001][2001];
void solve() {
    int n, l, r; cin >> n >> l >> r;
    vll a(n); 
    for(auto& x : a) cin >> x;
    const int K = 4;
    ll cand = 0;
    auto f = [&](int b) -> bool {
        memset(dp, -1, sizeof(dp));
        auto dfs = [&](auto& dfs, int i = 0, int g = 0) -> int {
            if(i == n) return l <= g && g <= r;
            if(g >= r) return false;
            auto& res = dp[i][g];
            if(res != -1) return res;
            ll x = 0;
            for(int j = i; j < n; j++) {
                x += a[j];
                if((cand >> b) == ((cand | x) >> b)) {
                    if(dfs(dfs, j + 1, g + 1)) return res = 1;
                }
            }
            return res = 0;
        };
        return dfs(dfs);
    };
    for(int b = K - 1; b >= 0; b--) {
        if(f(b)) continue;
        cand ^= 1LL << b;
    }
    cout << cand << '\n';
}

signed main() {
    int t = 1;
    for(int i = 1; i <= t; i++) {   
        solve();
    }
    return 0;
}

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