Submission #617283

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
617283	2022-08-01T10:27:26 Z	Hanksburger	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	29 ms	6988 KB

Main

#include <bits/stdc++.h>
using namespace std;
long long a[200005], l[200005], r[200005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n, ans=1e18;
    cin >> n;
    for (int i=1; i<=n; i++)
        cin >> a[i];
    for (int i=2; i<=n; i++)
        l[i]=l[i-1]+max(0LL, a[i-1]-a[i]+1);
    for (int i=n-1; i>=1; i--)
        r[i]=r[i+1]+max(0LL, a[i+1]-a[i]+1);
    for (int i=1; i<=n; i++)
        ans=min(ans, max(l[i], r[i]));
    cout << ans;
    return 0;
}

Subtask #1

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	368 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct

Subtask #2

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	0 ms	340 KB	Output is correct
6	Correct	1 ms	368 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	468 KB	Output is correct
17	Correct	1 ms	344 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	23 ms	6868 KB	Output is correct
27	Correct	22 ms	6888 KB	Output is correct
28	Correct	23 ms	6920 KB	Output is correct
29	Correct	23 ms	6896 KB	Output is correct
30	Correct	22 ms	6268 KB	Output is correct
31	Correct	24 ms	6864 KB	Output is correct
32	Correct	21 ms	6932 KB	Output is correct
33	Correct	24 ms	6924 KB	Output is correct
34	Correct	29 ms	6848 KB	Output is correct
35	Correct	20 ms	6052 KB	Output is correct
36	Correct	18 ms	6200 KB	Output is correct
37	Correct	18 ms	6192 KB	Output is correct
38	Correct	23 ms	6924 KB	Output is correct
39	Correct	22 ms	6988 KB	Output is correct
40	Correct	27 ms	6964 KB	Output is correct
41	Correct	21 ms	6900 KB	Output is correct
42	Correct	28 ms	6764 KB	Output is correct
43	Correct	21 ms	6876 KB	Output is correct
44	Correct	21 ms	6920 KB	Output is correct
45	Correct	20 ms	6896 KB	Output is correct
46	Correct	24 ms	6904 KB	Output is correct
47	Correct	21 ms	6860 KB	Output is correct
48	Correct	23 ms	6860 KB	Output is correct