답안 #993729

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
993729	2024-06-06T10:40:45 Z	simona1230	Tortoise (CEOI21_tortoise)	C++17	8 / 100	6 ms	20828 KB

tortoise

#include <bits/stdc++.h>

using namespace std;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
long long n,a[10001];

void read()
{
    cin>>n;
    for(long long i=1;i<=n;i++)
        cin>>a[i];
}

long long dp[10001][10001];
long long dl[10005],dr[10005];

void prec()
{
    for(long long i=1;i<=n;i++)
    {
        dl[i]=dl[i-1];
        if(a[i]==-1)dl[i]=i;
    }

    for(long long i=n;i>=1;i--)
    {
        dr[i]=dr[i+1];
        if(a[i]==-1)dr[i]=i;
    }
}

void solve()
{
    prec();

    for(long long i=0;i<=n;i++)
    {
        for(long long j=0;j<=2*n;j++)
        {
            dp[i][j]=-1e9;
        }
    }

    long long sum=0;
    for(long long i=1;i<=n;i++)
    {
        //cout<<i<<" "<<dl[i]<<" "<<dr[i]<<endl;
        if(a[i]==1)dp[i][i]=1,sum++;
    }

    long long ans=0;
    dp[0][0]=0;
    for(long long i=1;i<=n;i++)
    {
        if(a[i]!=1)continue;
        for(long long j=i;j<=2*i;j++)
        {
            for(long long pr=1;pr<i;pr++)
            {
                if(a[pr]!=1)continue;

                if(dl[pr])
                {
                    long long d=dl[pr];

                    long long f=j-(abs(d-i)+abs(d-pr));
                    if(f>=0)dp[i][j]=max(dp[i][j],dp[pr][f]+1);
                }

                if(dr[pr])
                {
                    long long d=dr[pr];

                    long long f=j-(abs(d-i)+abs(d-pr));
                    if(f>=0)dp[i][j]=max(dp[i][j],dp[pr][f]+1);
                }
            }

            //cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
            ans=max(ans,dp[i][j]);
        }
    }

    cout<<sum-ans<<endl;
}

int main()
{
    speed();
    read();
    solve();
    return 0;
}
/*
7
1 0 1 -1 -1 1 1

7
-1 1 0 0 -1 0 0
*/

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	0 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	0 ms	2396 KB	Output is correct
21	Correct	0 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct

Subtask #2
0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	0 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	0 ms	2396 KB	Output is correct
21	Correct	0 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Incorrect	6 ms	20828 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #3
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	0 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	0 ms	2396 KB	Output is correct
21	Correct	0 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Incorrect	6 ms	20828 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #4
0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	0 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	0 ms	2396 KB	Output is correct
21	Correct	0 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Incorrect	6 ms	20828 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	2396 KB	Output is correct
2	Correct	0 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	0 ms	2396 KB	Output is correct
5	Correct	0 ms	2396 KB	Output is correct
6	Correct	1 ms	2396 KB	Output is correct
7	Correct	0 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	0 ms	2396 KB	Output is correct
10	Correct	0 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	0 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	0 ms	2396 KB	Output is correct
15	Correct	0 ms	2396 KB	Output is correct
16	Correct	0 ms	2396 KB	Output is correct
17	Correct	0 ms	2396 KB	Output is correct
18	Correct	0 ms	2396 KB	Output is correct
19	Correct	0 ms	2396 KB	Output is correct
20	Correct	0 ms	2396 KB	Output is correct
21	Correct	0 ms	2396 KB	Output is correct
22	Correct	0 ms	2396 KB	Output is correct
23	Correct	0 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2392 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Incorrect	6 ms	20828 KB	Output isn't correct
28	Halted	0 ms	0 KB	-

답안 #993729

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 0 / 10.0

Subtask #3 0 / 30.0

Subtask #4 0 / 25.0

Subtask #5 0 / 27.0

Subtask #1
8.0 / 8.0

Subtask #2
0 / 10.0

Subtask #3
0 / 30.0

Subtask #4
0 / 25.0

Subtask #5
0 / 27.0