Submission #1099420

#	Time	Username	Problem	Language	Result	Execution time	Memory
1099420		alexander707070	Tortoise (CEOI21_tortoise)	C++14	18 / 100	2 ms	2144 KiB

tortoise

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

int n,a[MAXN];
int dist[MAXN],last,sum,nxt[MAXN];

int dp[MAXN][2*MAXN][2];
bool li[MAXN][2*MAXN][2];

int ff(int pos,int tim,int c){
    if(tim>2*n or pos>n)return 0;

    if(li[pos][tim][c])return dp[pos][tim][c];
    li[pos][tim][c]=true;

    if(c==1){
        if(nxt[pos]==2*n)dp[pos][tim][c]=0;
        else{
            for(int i=pos+1;i<=nxt[pos];i++){
                dp[pos][tim][c]=max(dp[pos][tim][c],ff(i,tim+2*nxt[pos]-pos-i,0)+1);
            }
        }
    }else{
        if(a[pos]>0){
            if(tim<=2*(pos-1))dp[pos][tim][c]=max(dp[pos][tim][c],ff(pos,tim,1));

            for(int s=0;tim+s*2*dist[pos]<=2*(pos-1) and s+1<=a[pos];s++){
                dp[pos][tim][c]=max(dp[pos][tim][c],ff(pos+1,tim+(s+1)*2*dist[pos]+1,0)+s+1);

                if(s+1<a[pos] and tim+2*(s+1)*dist[pos]>2*(pos-1))dp[pos][tim][c]=max(dp[pos][tim][c], ff(pos,tim+(s+1)*2*dist[pos],1)+s+1);
            }
        }

        if(pos<n)dp[pos][tim][c]=max(dp[pos][tim][c],ff(pos+1,tim+1,c));
    }

    return dp[pos][tim][c];
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        dist[i]=n;

        if(a[i]>=0)sum+=a[i];
    }

    last=-n;
    for(int i=1;i<=n;i++){
        if(a[i]==-1)last=i;
        dist[i]=min(dist[i],i-last);
    }

    last=2*n;
    for(int i=n;i>=1;i--){
        if(a[i]==-1)last=i;
        dist[i]=min(dist[i],last-i);
        
        nxt[i]=last;
    }

    cout<<sum-ff(1,0,0)<<"\n";
 
	return 0;
}

• Subtask 1: 8 / 8
• Subtask 2: 10 / 10
• Subtask 3: 0 / 30
• Subtask 4: 0 / 25
• Subtask 5: 0 / 27