Submission #926669

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
926669	2024-02-13T13:44:41 Z	VMaksimoski008	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	81 ms	5140 KB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main() {
    int n, i;
    cin >> n;
    
    vector<ll> P(n), S(n), v(n);
    for(i=0; i<n; i++) cin >> v[i];
    for(i=1; i<n; i++) P[i] = max(0ll, v[i-1]-v[i]+1) + P[i-1];
    for(i=n-2; i>=0; i--) S[i] = max(0ll, v[i+1]-v[i]+1) + S[i+1];

    ll ans = 1e18;
    for(i=0; i<n; i++) ans = min(ans, max(P[i], S[i]));
    cout << ans << '\n';
}

Subtask #1

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 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	348 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	348 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	348 KB	Output is correct
12	Correct	1 ms	348 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	600 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	600 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	2 ms	344 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	344 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	348 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	348 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	348 KB	Output is correct
12	Correct	1 ms	348 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	600 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	600 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	2 ms	344 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct
25	Correct	1 ms	344 KB	Output is correct
26	Correct	67 ms	4956 KB	Output is correct
27	Correct	55 ms	4952 KB	Output is correct
28	Correct	54 ms	4956 KB	Output is correct
29	Correct	55 ms	4956 KB	Output is correct
30	Correct	41 ms	5140 KB	Output is correct
31	Correct	58 ms	5116 KB	Output is correct
32	Correct	55 ms	4952 KB	Output is correct
33	Correct	58 ms	4956 KB	Output is correct
34	Correct	54 ms	4956 KB	Output is correct
35	Correct	39 ms	4956 KB	Output is correct
36	Correct	41 ms	4956 KB	Output is correct
37	Correct	42 ms	4956 KB	Output is correct
38	Correct	54 ms	5120 KB	Output is correct
39	Correct	54 ms	4956 KB	Output is correct
40	Correct	54 ms	5120 KB	Output is correct
41	Correct	54 ms	4952 KB	Output is correct
42	Correct	51 ms	4952 KB	Output is correct
43	Correct	55 ms	5120 KB	Output is correct
44	Correct	54 ms	5120 KB	Output is correct
45	Correct	54 ms	4956 KB	Output is correct
46	Correct	54 ms	5124 KB	Output is correct
47	Correct	81 ms	4952 KB	Output is correct
48	Correct	62 ms	5124 KB	Output is correct