oj.uz

Submission #1099395

# Submission time Handle Problem Language Result Execution time Memory
1099395 2024-10-11T09:08:43 Z alexander707070 Tortoise (CEOI21_tortoise) C++14
0 / 100
 0 ms 348 KB 
#include<bits/stdc++.h>
#define MAXN 307
using namespace std;

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

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

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

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

    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,tim+(s+1)*2*dist[pos],0)+s+1);
        }
    }

    if(c==1 and a[pos]==-1)dp[pos][tim][c]=max(dp[pos][tim][c],ff(pos,tim,0)+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);
    }

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

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -