Submission #404761

# Submission time Handle Problem Language Result Execution time Memory
404761 2021-05-14T23:44:32 Z ScarletS Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
36 ms 6168 KB
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const int N = 2e5+7;
int a[N];
ll dp[N][2];

ll max(ll x, ll y)
{
    if (x>y)
        return x;
    return y;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n;
    cin>>n;
    ll ans=1e18;
    for (int i=1;i<=n;++i)
        cin>>a[i];
    for (int i=1;i<=n;++i)
        dp[i][0]=dp[i-1][0]+max(a[i-1]+1-a[i],0);
    for (int i=n;i;--i)
        dp[i][1]=dp[i+1][1]+max(a[i+1]+1-a[i],0);
    for (int i=1;i<=n;++i)
        ans=min(ans,max(dp[i-1][0],dp[i+1][1])+max(0,max(a[i-1]+1-a[i]-max(0,dp[i][1]-dp[i][0]),a[i+1]+1-a[i]-max(0,dp[i][0]-dp[i][1]))));
    cout<<ans;
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 460 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 356 KB Output is correct
24 Correct 1 ms 460 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 35 ms 6148 KB Output is correct
27 Correct 30 ms 6084 KB Output is correct
28 Correct 29 ms 6084 KB Output is correct
29 Correct 29 ms 6076 KB Output is correct
30 Correct 27 ms 5444 KB Output is correct
31 Correct 31 ms 6096 KB Output is correct
32 Correct 32 ms 6084 KB Output is correct
33 Correct 29 ms 6080 KB Output is correct
34 Correct 28 ms 6084 KB Output is correct
35 Correct 24 ms 5360 KB Output is correct
36 Correct 26 ms 5452 KB Output is correct
37 Correct 28 ms 5440 KB Output is correct
38 Correct 29 ms 6064 KB Output is correct
39 Correct 35 ms 6076 KB Output is correct
40 Correct 29 ms 6084 KB Output is correct
41 Correct 32 ms 6096 KB Output is correct
42 Correct 27 ms 5920 KB Output is correct
43 Correct 28 ms 6108 KB Output is correct
44 Correct 28 ms 6084 KB Output is correct
45 Correct 29 ms 6128 KB Output is correct
46 Correct 35 ms 6064 KB Output is correct
47 Correct 36 ms 6168 KB Output is correct
48 Correct 29 ms 6048 KB Output is correct