oj.uz

Submission #1099457

# Submission time Handle Problem Language Result Execution time Memory
1099457 2024-10-11T10:13:33 Z alexander707070 Tortoise (CEOI21_tortoise) C++14
48 / 100
 3000 ms 255060 KB 
#include<bits/stdc++.h>
#define MAXN 5007
using namespace std;

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

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

int ff(int pos,int tim,int c){
    if(tim>2*n or pos>n)return 0;
    return dp[pos%2][tim][c];
}

struct Fenwick{
    int fenwick[MAXN];

    void update(int x,int val){
        while(x<=n){
            fenwick[x]=max(fenwick[x],val);
            x+=(x & (-x));
        }
    }

    int getmax(int x){
        int res=0;
        while(x>=1){
            res=max(res,fenwick[x]);
            x-=(x & (-x));
        }
        return res;
    }
};

Fenwick fen[3*MAXN];

void calcdp(){
    for(int pos=n;pos>=1;pos--){
        for(int tim=2*n;tim>=0;tim--){
            for(int c=1;c>=0;c--){

                dp[pos%2][tim][c]=0;
                
                if(c==1){
                    if(nxt[pos]==2*n)dp[pos%2][tim][c]=0;
                    else{
                        if(tim+2*nxt[pos]-pos>3*n)dp[pos%2][tim][c]=1;
                        else dp[pos%2][tim][c]=fen[tim+2*nxt[pos]-pos].getmax(nxt[pos])+1;
                    }
                }else{
                    if(a[pos]>0){
                        if(tim<=2*(pos-1))dp[pos%2][tim][c]=max(dp[pos%2][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%2][tim][c]=max(dp[pos%2][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%2][tim][c]=max(dp[pos%2][tim][c], ff(pos,tim+(s+1)*2*dist[pos],1)+s+1);
                        }
                    }

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

        for(int tim=2*n;tim>=0;tim--){
            fen[pos+tim].update(pos,dp[pos%2][tim][0]);
        }
    }
}

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;
    }

    calcdp();
    cout<<sum-dp[1][0][0]<<"\n";
 
	return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 4 ms 4180 KB Output is correct
28 Correct 6 ms 4700 KB Output is correct
29 Correct 4 ms 4484 KB Output is correct
30 Correct 4 ms 3932 KB Output is correct
31 Correct 5 ms 4700 KB Output is correct
32 Correct 3 ms 3420 KB Output is correct
33 Correct 5 ms 4444 KB Output is correct
34 Correct 4 ms 3932 KB Output is correct
35 Correct 5 ms 4900 KB Output is correct
36 Correct 5 ms 4956 KB Output is correct
37 Correct 5 ms 4960 KB Output is correct
38 Correct 5 ms 4956 KB Output is correct
39 Correct 5 ms 4956 KB Output is correct
40 Correct 5 ms 4956 KB Output is correct
41 Correct 5 ms 4956 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 4 ms 4180 KB Output is correct
28 Correct 6 ms 4700 KB Output is correct
29 Correct 4 ms 4484 KB Output is correct
30 Correct 4 ms 3932 KB Output is correct
31 Correct 5 ms 4700 KB Output is correct
32 Correct 3 ms 3420 KB Output is correct
33 Correct 5 ms 4444 KB Output is correct
34 Correct 4 ms 3932 KB Output is correct
35 Correct 5 ms 4900 KB Output is correct
36 Correct 5 ms 4956 KB Output is correct
37 Correct 5 ms 4960 KB Output is correct
38 Correct 5 ms 4956 KB Output is correct
39 Correct 5 ms 4956 KB Output is correct
40 Correct 5 ms 4956 KB Output is correct
41 Correct 5 ms 4956 KB Output is correct
42 Correct 2 ms 3164 KB Output is correct
43 Correct 3 ms 3208 KB Output is correct
44 Correct 4 ms 3676 KB Output is correct
45 Correct 5 ms 4444 KB Output is correct
46 Correct 3 ms 3692 KB Output is correct
47 Correct 3 ms 3160 KB Output is correct
48 Correct 4 ms 4188 KB Output is correct
49 Correct 3 ms 3676 KB Output is correct
50 Correct 6 ms 4500 KB Output is correct
51 Correct 6 ms 4700 KB Output is correct
52 Correct 4 ms 3420 KB Output is correct
53 Correct 7 ms 4444 KB Output is correct
54 Correct 10 ms 4444 KB Output is correct
55 Correct 6 ms 3932 KB Output is correct
56 Correct 6 ms 4700 KB Output is correct
57 Correct 3 ms 3160 KB Output is correct
58 Correct 5 ms 4444 KB Output is correct
59 Correct 3 ms 3420 KB Output is correct
60 Correct 5 ms 4188 KB Output is correct
61 Correct 5 ms 4444 KB Output is correct
62 Correct 4 ms 4492 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 4 ms 4180 KB Output is correct
28 Correct 6 ms 4700 KB Output is correct
29 Correct 4 ms 4484 KB Output is correct
30 Correct 4 ms 3932 KB Output is correct
31 Correct 5 ms 4700 KB Output is correct
32 Correct 3 ms 3420 KB Output is correct
33 Correct 5 ms 4444 KB Output is correct
34 Correct 4 ms 3932 KB Output is correct
35 Correct 5 ms 4900 KB Output is correct
36 Correct 5 ms 4956 KB Output is correct
37 Correct 5 ms 4960 KB Output is correct
38 Correct 5 ms 4956 KB Output is correct
39 Correct 5 ms 4956 KB Output is correct
40 Correct 5 ms 4956 KB Output is correct
41 Correct 5 ms 4956 KB Output is correct
42 Correct 2 ms 3164 KB Output is correct
43 Correct 3 ms 3208 KB Output is correct
44 Correct 4 ms 3676 KB Output is correct
45 Correct 5 ms 4444 KB Output is correct
46 Correct 3 ms 3692 KB Output is correct
47 Correct 3 ms 3160 KB Output is correct
48 Correct 4 ms 4188 KB Output is correct
49 Correct 3 ms 3676 KB Output is correct
50 Correct 6 ms 4500 KB Output is correct
51 Correct 6 ms 4700 KB Output is correct
52 Correct 4 ms 3420 KB Output is correct
53 Correct 7 ms 4444 KB Output is correct
54 Correct 10 ms 4444 KB Output is correct
55 Correct 6 ms 3932 KB Output is correct
56 Correct 6 ms 4700 KB Output is correct
57 Correct 3 ms 3160 KB Output is correct
58 Correct 5 ms 4444 KB Output is correct
59 Correct 3 ms 3420 KB Output is correct
60 Correct 5 ms 4188 KB Output is correct
61 Correct 5 ms 4444 KB Output is correct
62 Correct 4 ms 4492 KB Output is correct
63 Correct 2108 ms 251732 KB Output is correct
64 Correct 2261 ms 253684 KB Output is correct
65 Correct 2142 ms 254212 KB Output is correct
66 Correct 2143 ms 251344 KB Output is correct
67 Correct 2118 ms 255060 KB Output is correct
68 Correct 2149 ms 249884 KB Output is correct
69 Correct 2120 ms 254192 KB Output is correct
70 Correct 2242 ms 254672 KB Output is correct
71 Execution timed out 3073 ms 59892 KB Time limit exceeded
72 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 4 ms 4180 KB Output is correct
28 Correct 6 ms 4700 KB Output is correct
29 Correct 4 ms 4484 KB Output is correct
30 Correct 4 ms 3932 KB Output is correct
31 Correct 5 ms 4700 KB Output is correct
32 Correct 3 ms 3420 KB Output is correct
33 Correct 5 ms 4444 KB Output is correct
34 Correct 4 ms 3932 KB Output is correct
35 Correct 5 ms 4900 KB Output is correct
36 Correct 5 ms 4956 KB Output is correct
37 Correct 5 ms 4960 KB Output is correct
38 Correct 5 ms 4956 KB Output is correct
39 Correct 5 ms 4956 KB Output is correct
40 Correct 5 ms 4956 KB Output is correct
41 Correct 5 ms 4956 KB Output is correct
42 Correct 2 ms 3164 KB Output is correct
43 Correct 3 ms 3208 KB Output is correct
44 Correct 4 ms 3676 KB Output is correct
45 Correct 5 ms 4444 KB Output is correct
46 Correct 3 ms 3692 KB Output is correct
47 Correct 3 ms 3160 KB Output is correct
48 Correct 4 ms 4188 KB Output is correct
49 Correct 3 ms 3676 KB Output is correct
50 Correct 6 ms 4500 KB Output is correct
51 Correct 6 ms 4700 KB Output is correct
52 Correct 4 ms 3420 KB Output is correct
53 Correct 7 ms 4444 KB Output is correct
54 Correct 10 ms 4444 KB Output is correct
55 Correct 6 ms 3932 KB Output is correct
56 Correct 6 ms 4700 KB Output is correct
57 Correct 3 ms 3160 KB Output is correct
58 Correct 5 ms 4444 KB Output is correct
59 Correct 3 ms 3420 KB Output is correct
60 Correct 5 ms 4188 KB Output is correct
61 Correct 5 ms 4444 KB Output is correct
62 Correct 4 ms 4492 KB Output is correct
63 Correct 2108 ms 251732 KB Output is correct
64 Correct 2261 ms 253684 KB Output is correct
65 Correct 2142 ms 254212 KB Output is correct
66 Correct 2143 ms 251344 KB Output is correct
67 Correct 2118 ms 255060 KB Output is correct
68 Correct 2149 ms 249884 KB Output is correct
69 Correct 2120 ms 254192 KB Output is correct
70 Correct 2242 ms 254672 KB Output is correct
71 Execution timed out 3073 ms 59892 KB Time limit exceeded
72 Halted 0 ms 0 KB -