Submission #33773

#	Time	Username	Problem	Language	Result	Execution time	Memory
33773		dqhungdl	Bali Sculptures (APIO15_sculpture)	C++14	100 / 100	103 ms	10060 KiB

sculpture

#include <bits/stdc++.h>
using namespace std;

const int64_t MAX=41;
int64_t n,A,B,a[2005],F1[2005];
bool Free[2005][2005],F[2005][2005],Free1[2005];

int64_t f1(int64_t i,int64_t mask)
{
    if(Free1[i]==true)
        return F1[i];
    F1[i]=1e9;
    Free1[i]=true;
    if(i>n)
        return F1[i]=0;
    for(int64_t t=i; t<=n; t++)
    {
        int64_t tmp=a[t]-a[i-1];
        if((mask|tmp)==mask)
            F1[i]=min(F1[i],f1(t+1,mask)+1);
    }
    return F1[i];
}

bool f(int64_t i,int64_t j,int64_t mask)
{
    if(Free[i][j]==true)
        return F[i][j];
    Free[i][j]=true;
    if(j>B)
        return F[i][j]=false;
    if(i>n)
        return F[i][j]=(A<=j);
    for(int64_t t=i; t<=n; t++)
    {
        int64_t tmp=a[t]-a[i-1];
        if((mask|tmp)==mask&&f(t+1,j+1,mask)==true)
            return F[i][j]=true;
    }
    return F[i][j]=false;
}

int main()
{
    ios_base::sync_with_stdio(false);
    //freopen("TEST.INP","r",stdin);
    cin>>n>>A>>B;
    for(int64_t i=1; i<=n; i++)
    {
        cin>>a[i];
        a[i]+=a[i-1];
    }
    int64_t res=(int64_t(1)<<MAX)-1;
    if(A==1)
        for(int64_t i=MAX-1; i>=0; i--)
        {
            for(int64_t j=1; j<=n; j++)
                Free1[j]=false;
            if(f1(1,res-(int64_t(1)<<i))<=B)
                res-=int64_t(1)<<i;
        }
    else
        for(int64_t i=MAX-1; i>=0; i--)
        {
            for(int64_t j=1; j<=n; j++)
                for(int64_t t=0; t<=B; t++)
                    Free[j][t]=false;
            if(f(1,0,res-(int64_t(1)<<i))==true)
                res-=int64_t(1)<<i;
        }
    cout<<res;
}

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