Submission #549159

#	Time	Username	Problem	Language	Result	Execution time	Memory
549159		CyberSleeper	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	134 ms	360 KiB

sculpture

#include <bits/stdc++.h>
#define fastio      ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define debug(x)    cout << "Line " << __LINE__ << ", " << #x << " is " << x << endl
#define all(x)      x.begin(), x.end()
#define fi          first
#define se          second
#define mp          make_pair
#define pb          push_back
#define ll          long long
#define ull         unsigned long long
#define pll         pair<ll, ll>
#define pii         pair<ll, ll>
#define ld          long double
#define nl          endl
#define tb          '\t'
#define sp          ' '
#define sqr(x)      (x)*(x)
using namespace std;

const ll MX=2002, MOD=1000000007, BLOCK=327, INF=2e9+7, LG=62;
const ll INFF=1000000000000000007;
const ld ERR=1e-6, pi=3.14159265358979323846;

ll N, L, R, A[MX], pref[MX], ans;

ll getp(ll le, ll ri){
    return pref[ri]-pref[le-1];
}

int main(){
    fastio;
    cin >> N >> L >> R;
    for(ll i=1; i<=N; i++){
        cin >> A[i];
        pref[i]=pref[i-1]+A[i];
    }
    if(L==1){
        ll DP[2005];
        for(ll bit=LG; bit>=0; bit--){
            for(int i=0; i<=2002; i++)
                DP[i]=INF;
            DP[1]=0;
            for(ll i=1; i<=N; i++){
                for(ll k=i; k<=N; k++){
                    ll tmp=(getp(i, k)>>bit);
                    tmp=tmp<<bit;
                    if((tmp|ans)==ans)
                        DP[k+1]=min(DP[k+1], DP[i]+1);
                }
            }
            if(DP[N+1]>R)
                ans+=(1ll<<bit);
        }
    }else{
        bool DP[105][105];
        for(ll bit=LG; bit>=0; bit--){
            memset(DP, 0, sizeof(DP));
            DP[1][0]=1;
            for(ll i=1; i<=N; i++){
                for(ll j=0; j<N; j++){
                    for(ll k=i; k<=N; k++){
                        ll tmp=(getp(i, k)>>bit);
                        tmp=tmp<<bit;
                        if((tmp|ans)==ans)
                            DP[k+1][j+1]|=DP[i][j];
                    }
                }
            }
            ans+=(1ll<<bit);
            for(ll i=L; i<=R; i++){
                if(DP[N+1][i]){
                    ans-=(1ll<<bit);
                    break;
                }
            }
        }
    }
    cout << ans << nl;
}

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