Submission #1305540

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305540		xosqedemrufo	Bali Sculptures (APIO15_sculpture)	C++20	21 / 100	9 ms	696 KiB

sculpture

//Author RufatM
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<string> vs;
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl '\n'
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ff first
#define ss second
#define all(x) begin(x),end(x)
#define rall(x) rbegin(x),rend(x)
#define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
const int MOD=998244353;
const int INF=1e9;
const ll LINF=1e18;
const int MAXN=200005;
ll n,a,b;
vll y;
vll pref;
map<pll,ll> dp;
ll f(ll pos,ll sum){
    if(pos==n){
        if(sum>=a and sum<=b){
            return 0;
        }
        else{
            return LINF;
        }
    }
    if(sum>=b){
        return LINF;
    }
    if(dp.count({pos,sum})){
        return dp[{pos,sum}];
    }
    ll cnt = LINF;
    for(int i=pos;i<n;i++){
        ll tmp = f(i+1,sum+1);
        if(tmp != LINF){
            cnt = min(cnt,tmp|(pref[i+1]-pref[pos]));
        }
    }
    return dp[{pos,sum}] = cnt;
}
signed main(){
    fastio;
    int t=1;
    //cin >> t;
    while(t--){       
        cin >> n >> a >> b;
        y.resize(n);
        pref.assign(n+1,0);
        for(int i=0;i<n;i++){
            cin >> y[i];
            pref[i+1] = pref[i]+y[i];
        }
        dp.clear();
        cout << f(0,0) << endl;
    }
}

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