Submission #995285

#	Time	Username	Problem	Language	Result	Execution time	Memory
995285		dreamboy	Bali Sculptures (APIO15_sculpture)	C++17	100 / 100	82 ms	604 KiB

sculpture

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define russian setlocale(LC_ALL,"Russian_Russia.20866");
#define file freopen("onlyone.in", "r", stdin), freopen("onlyone.out", "w", stdout);
#define ll long long
#define ull unsigned long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define all(s) s.begin(), s.end()
#define pb push_back
#define ins insert
#define mp make_pair
#define sz(x) x.size()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define mem(x) memset(x, 0, sizeof(x))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const ll N = 2010;
const ll M = 600000;
const ll block = 316;
const ll mod = 998244353;
const ll P = 263;
const ld pi = acos(-1);
const ll inf = 1e9;

ll add(ll a, ll b) {
    if(a + b < 0) return a + b + mod;
    if(a + b >= mod) return a + b - mod;
    return a + b;
}

ll sub(ll a, ll b) {
    return (a - b + mod) % mod;
}

ll mul(ll a, ll b) {
    return a * 1LL * b % mod;
}

ll binpow(ll a, ll n) {
    ll res = 1LL;
    while(n) {
        if(n & 1) res = mul(res, a); // if(n % 2 == 1)
        a = mul(a, a);
        n >>= 1; //n / 2
    }
    return res;
}

ll inv(ll x) {//число х в степени -1
    return binpow(x, mod - 2);
}
ll n, a, b;
ll y[2010];
bool check124(ll msk) {
    bool dp[n + 1][n + 1];
    for(ll i = 0; i <= n; i++) {
        for(ll j = 0; j <= n; j++) {
            dp[i][j] = false;
        }
    }
    dp[0][0] = true;
    for(ll i = 0; i < n; i++) {
        for(ll j = 0; j < n; j++) {
            if(dp[i][j]) {
                ll cur = 0LL;
                for(ll k = i + 1; k <= n; k++) {
                    cur += y[k];
                    if((cur | msk) == msk) {
                        dp[k][j + 1] = true;
                    }
                }
            }
        }
    }
    for(ll i = a; i <= b; i++) {
        if(dp[n][i]) {
            return true;
        }
    }
    return false;
}
bool check35(ll msk) {
    ll dp[n + 1];
    fill(dp, dp + n + 1, inf);
    dp[0] = 0LL;
    for(ll i = 0; i < n; i++) {
        if(dp[i] == inf) continue;
        ll cur = 0LL;
        for(ll k = i + 1; k <= n; k++) {
            cur += y[k];
            if((cur | msk) == msk) {
                dp[k] = min(dp[k], dp[i] + 1LL);
            }
        }
    }
    return (dp[n] <= b);
}
void solve() {
    cin >> n >> a >> b;
    for(ll i = 1; i <= n; i++) cin >> y[i];
    if(a == 1) {
        ll ans = (1LL << 41LL) - 1LL;
        for(ll i = 40; i >= 0; i--) {
            if(check35(ans ^ (1LL << i))) {
                ans ^= (1LL << i);
            }
        }
        cout << ans << '\n';
        return;
    }
    ll ans = (1LL << 37LL) - 1LL;
    for(ll i = 36; i >= 0; i--) {
        if(check124(ans ^ (1LL << i))) {
            ans ^= (1LL << i);
        }
    }
    cout << ans << '\n';
}
signed main() {
    speed;
    //file;
    int test = 1;
    //cin >> test;
    while(test--) {
        solve();
    }
}

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