Submission #1305567

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305567		ulvix	Bali Sculptures (APIO15_sculpture)	C++20	0 / 100	1 ms	632 KiB

sculpture

// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#ifdef ULVI
    #include "debug.hpp"
#else
    #define db(...)
    #define dbv(v)
    #define line()
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define ff first
#define ss second
#define enld endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll sz=2e5+100;
const ll mod=1e9+7;
const ll inf=1e18;
template<class T>
using indexed_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

void solve(){
    ll n,l,r;
    cin>>n>>l>>r;
    vector<ll> v(n+5),pref(n+5);
    for(ll i=1;i<=n;i++){
        cin>>v[i];
        pref[i]=pref[i-1]+v[i];
    }
    vector<vector<ll>> dp(n+5,vector<ll>(r+5,inf));
    for(ll i=1;i<=n;i++){
        dp[i][1]=pref[i];
        for(ll j=2;j<=min(i,r);j++){
            for(ll k=j-1;k<i;k++){
                ll sum=pref[i]-pref[k];
                dp[i][j]=min(dp[i][j],dp[k][j-1]|sum);
            }
        }
    }
    ll ans=inf;
    for(ll i=l;i<=r;i++) ans=min(ans,dp[n][i]);
    cout<<ans<<'\n';
}

int main(){
    // freopen("input.txt","r",stdin);
    // freopen("output.txt","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll t=1;
    // cin>>t;
    for(ll _=1;_<=t;_++){
        // cout<<"Scenario #"<<_<<":\n";
        solve();
    }
}

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