Submission #936671

# Submission time Handle Problem Language Result Execution time Memory
936671 2024-03-02T13:23:06 Z anton Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
87 ms 7048 KB
#include<bits/stdc++.h>

using namespace std;
#define int long long
#define pii pair<int, int>


vector<int> dp[2];

signed main(){
    int n;
    cin>>n;
    vector<int>v(n);
    for(int i = 0; i<n; i++){
        cin>>v[i];
    }

    for(int i = 0; i<2; i++){
        dp[i].resize(n);

        dp[i][0] = 0;
        for(int j = 1; j<n; j++){
            dp[i][j] = dp[i][j-1];
            if(v[j]<=v[j-1]){
                dp[i][j] += v[j-1]-v[j]+1;
            }
        }
        reverse(v.begin(), v.end());
    }
    reverse(dp[1].begin(), dp[1].end());

    int res= 1e18;
    for(int i = 0; i<n; i++){
        //cout<<dp[0][i]<<" "<<dp[1][i]<<endl;
        res = min(res, max(dp[0][i], dp[1][i]));
    }
    cout<<res<<endl;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 444 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 444 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 59 ms 6852 KB Output is correct
27 Correct 59 ms 6992 KB Output is correct
28 Correct 59 ms 6852 KB Output is correct
29 Correct 58 ms 6976 KB Output is correct
30 Correct 46 ms 6224 KB Output is correct
31 Correct 62 ms 7000 KB Output is correct
32 Correct 58 ms 6992 KB Output is correct
33 Correct 58 ms 6836 KB Output is correct
34 Correct 87 ms 6840 KB Output is correct
35 Correct 42 ms 6228 KB Output is correct
36 Correct 44 ms 6336 KB Output is correct
37 Correct 47 ms 6332 KB Output is correct
38 Correct 58 ms 6852 KB Output is correct
39 Correct 60 ms 6996 KB Output is correct
40 Correct 63 ms 6992 KB Output is correct
41 Correct 58 ms 6968 KB Output is correct
42 Correct 55 ms 6740 KB Output is correct
43 Correct 58 ms 6992 KB Output is correct
44 Correct 58 ms 6992 KB Output is correct
45 Correct 59 ms 6992 KB Output is correct
46 Correct 64 ms 7048 KB Output is correct
47 Correct 69 ms 6996 KB Output is correct
48 Correct 58 ms 6964 KB Output is correct