Submission #303636

#	Time	Username	Problem	Language	Result	Execution time	Memory
303636		vipghn2003	Bali Sculptures (APIO15_sculpture)	C++14	71 / 100	1090 ms	2424 KiB

sculpture

#include<bits/stdc++.h>

using namespace std;

const int N=2005;
int n,l,r,a[N];
bool dp[N][N];
vector<int>offbit,go[N];

bool Try(int k)
{
    offbit.push_back(k);
    for(int i=1;i<=n;i++) go[i].clear();
    for(int i=1;i<=n;i++)
    {
        long long cur=0;
        for(int j=i;j<=n;j++)
        {
            cur+=a[j];
            bool kt=true;
            for(auto&x:offbit)
            {
                if(cur>>x&1)
                {
                    kt=false;
                    break;
                }
            }
            if(kt) go[j].push_back(i);
        }
    }
    offbit.pop_back();
    dp[0][0]=true;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=i;j++)
        {
            dp[i][j]=false;
            for(auto&to:go[i]) dp[i][j]=max(dp[i][j],dp[to-1][j-1]);
        }
    }
    for(int i=l;i<=r;i++) if(dp[n][i]) return true;
    return false;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>n>>l>>r;
    for(int i=1;i<=n;i++) cin>>a[i];
    long long res=0;
    for(int i=50;i>=0;i--)
    {
        if(Try(i)) offbit.push_back(i);
        else res+=(1ll<<i);
    }
    cout<<res;
}

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