Submission #936887

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
936887	2024-03-03T01:35:09 Z	the_coding_pooh	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	66 ms	6996 KB

Main

#include <bits/stdc++.h>
#define uwu return 0;

using namespace std;

const int SIZE = 2e5 + 5;

int N;

const long long INF = 1e18 + 5;

long long from_f[SIZE], from_e[SIZE], h[SIZE];

int main(){
    cin >> N;
    for (int i = 1; i <= N;i++){
        cin >> h[i];
    }

    for (int i = 1; i <= N;i++){
        from_f[i] = from_f[i - 1] + max(0LL, h[i - 1] - h[i] + 1);
        //cout << from_f[i] << '\n';
    }
    
    for (int i = N; i >= 1;i--){
        from_e[i] = from_e[i + 1] + max(0LL, h[i + 1] - h[i] + 1);
    }

    long long ans = INF;

    for (int i = 1; i <= N;i++){
        ans = min(ans, max(from_f[i], from_e[i]));
    }

    cout << ans << '\n';
}

Subtask #1

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	2 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	600 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Correct	1 ms	500 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	600 KB	Output is correct
17	Correct	1 ms	348 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	456 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct

Subtask #2

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	2 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	344 KB	Output is correct
10	Correct	1 ms	600 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	460 KB	Output is correct
13	Correct	1 ms	500 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	600 KB	Output is correct
17	Correct	1 ms	348 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	456 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	2 ms	348 KB	Output is correct
26	Correct	66 ms	6996 KB	Output is correct
27	Correct	56 ms	6980 KB	Output is correct
28	Correct	56 ms	6992 KB	Output is correct
29	Correct	56 ms	6992 KB	Output is correct
30	Correct	42 ms	6220 KB	Output is correct
31	Correct	56 ms	6996 KB	Output is correct
32	Correct	57 ms	6852 KB	Output is correct
33	Correct	56 ms	6992 KB	Output is correct
34	Correct	57 ms	6868 KB	Output is correct
35	Correct	40 ms	6224 KB	Output is correct
36	Correct	41 ms	6232 KB	Output is correct
37	Correct	47 ms	6476 KB	Output is correct
38	Correct	56 ms	6996 KB	Output is correct
39	Correct	56 ms	6996 KB	Output is correct
40	Correct	57 ms	6988 KB	Output is correct
41	Correct	55 ms	6988 KB	Output is correct
42	Correct	53 ms	6652 KB	Output is correct
43	Correct	57 ms	6988 KB	Output is correct
44	Correct	61 ms	6996 KB	Output is correct
45	Correct	56 ms	6980 KB	Output is correct
46	Correct	57 ms	6872 KB	Output is correct
47	Correct	56 ms	6980 KB	Output is correct
48	Correct	61 ms	6852 KB	Output is correct