Submission #1305523

#	Time	Username	Problem	Language	Result	Execution time	Memory
1305523		xosqedemrufo	Bali Sculptures (APIO15_sculpture)	C++20	0 / 100	1 ms	580 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;
signed main(){
    fastio;
    int t=1;
    //cin >> t;
    while(t--){       
        ll n,a,b;
        cin >> n >> a >> b;
        vll y(n);
        for(int i=0;i<n;i++){
            cin >> y[i];
        } 
        vll pref(n+1,0);
        for(int i=1;i<=n;i++){
            pref[i] = pref[i-1]+y[i-1];
        }
        vector<vector<ll>> dp(n+1,vll(b+1,INF));
        dp[0][0] = 0;
        for(int k=1;k<=b;k++){
            for(int i=1;i<=n;i++){
                for(int j=k-1;j<i;j++){
                    ll sum = pref[i]-pref[j];
                    dp[i][k] = min(dp[i][k],dp[j][k-1]|sum);
                }
            }
        }
        ll ans = INF;
        for(int k=a;k<=b;k++){
            ans = min(ans,dp[n][k]);
        }
        cout << ans << endl;
    }
}

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