Submission #974395

#	Time	Username	Problem	Language	Result	Execution time	Memory
974395		raul2008487	Bali Sculptures (APIO15_sculpture)	C++17	71 / 100	1033 ms	6736 KiB

sculpture

#include <bits/stdc++.h>

// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>

#define ll long long
#define pb push_back
#define vl vector<ll>
#define fi first
#define se second
#define in insert
#define all(v) v.begin(), v.end()
#define bpc(x) __builtin_popcount(x)
#define endl "\n"

using namespace std;
const int sz = 2005; /// mind the sz
// using namespace __gnu_pbds;
// tree <ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> rbt;
ll n, A, B, pr[sz], a[sz], ca;
bool dp[sz][sz], used[sz][sz];
bool rec(ll idx, ll blocks, ll bt){
    if(idx == (n + 1)){
        return (A <= blocks && blocks <= B);
    }
    if(used[idx][blocks]){return dp[idx][blocks];}
    for(int j = idx + 1; j <= (n + 1); j++){
        ll t = (pr[j - 1] - pr[idx - 1]);
        if(((ca | t) >> bt << bt) == ca && rec(j, blocks + 1, bt)){
            return used[idx][blocks] = dp[idx][blocks] = 1;
        }
    }
    used[idx][blocks] = 1;
    return dp[idx][blocks] = 0;
}
void solve(){
    ll i, j;
    cin >> n >> A >> B;
    for(i = 1; i <= n; i++){
        cin >> a[i];
        pr[i] = pr[i - 1] + a[i];
    }
    for(i = 60; i >= 0; i--){
        // cout << i << ' ' << rec(1, 0, i) << endl;
        ca |= (!rec(1, 0, i)) * (1ll << i);
        memset(used, false, sizeof(used));
    }
    cout << ca << endl;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
}
/*
6 1 3
8 1 2 1 5 4
*/

Compilation message (stderr)

sculpture.cpp: In function 'void solve()':
sculpture.cpp:37:11: warning: unused variable 'j' [-Wunused-variable]
   37 |     ll i, j;
      |           ^

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