Submission #518405

#	Time	Username	Problem	Language	Result	Execution time	Memory
518405		julian33	Bali Sculptures (APIO15_sculpture)	C++14	37 / 100	21 ms	768 KiB

sculpture

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN=2e3+5; //make sure this is right
const int mod=1e9+7;

int dp[mxN][mxN];
ll psa[mxN];

int main(){
    cin.sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifdef LOCAL
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif

    int n,a,b; cin>>n>>a>>b;
    for(int i=1;i<=n;i++){
        cin>>psa[i];
        psa[i]+=psa[i-1];
    }
    if(n<=100){
        int msk=0;
        for(int i=31;i>=0;i--){
            msk|=(1<<i);
            dp[0][0]=1;
            int yes=0;
            for(int j=1;j<=n;j++){
                for(int k=1;k<=b;k++){
                    dp[j][k]=0;
                    for(int p=j-1;p>=0;p--){
                        dp[j][k]|=(dp[p][k-1] && !(msk&(psa[j]-psa[p])));
                    }
                }
            }
            for(int j=a;j<=b;j++)
                yes|=dp[n][j];
            if(!yes) msk^=(1<<i);
        }
        cout<<(~msk)<<"\n";
    } else{
        assert(false);
    }
}

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