Submission #372222

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
372222	2021-02-27T09:41:38 Z	dolphingarlic	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	33 ms	5120 KB

Main

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

ll a[200002], pref[200002], suff[200002];

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> a[i];
	for (int i = 1; i <= n; i++) pref[i] = pref[i - 1] + max(0ll, a[i - 1] - a[i] + 1);
	for (int i = n; i; i--) suff[i] = suff[i + 1] + max(0ll, a[i + 1] - a[i] + 1);
	ll ans = LLONG_MAX;
	for (int i = 1; i < n; i++)
		ans = min(ans, max(pref[i], suff[i + 1]) + (a[i] + pref[i] == a[i + 1] + suff[i + 1]));
	cout << ans;
	return 0;
}

Subtask #1

40.0 / 40.0

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

Subtask #2

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	512 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	512 KB	Output is correct
16	Correct	1 ms	368 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	512 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	512 KB	Output is correct
26	Correct	29 ms	5104 KB	Output is correct
27	Correct	26 ms	4972 KB	Output is correct
28	Correct	26 ms	5120 KB	Output is correct
29	Correct	26 ms	4972 KB	Output is correct
30	Correct	24 ms	4972 KB	Output is correct
31	Correct	25 ms	4972 KB	Output is correct
32	Correct	26 ms	4972 KB	Output is correct
33	Correct	26 ms	4972 KB	Output is correct
34	Correct	26 ms	4972 KB	Output is correct
35	Correct	22 ms	5120 KB	Output is correct
36	Correct	22 ms	4972 KB	Output is correct
37	Correct	22 ms	4972 KB	Output is correct
38	Correct	31 ms	4972 KB	Output is correct
39	Correct	26 ms	4972 KB	Output is correct
40	Correct	31 ms	4972 KB	Output is correct
41	Correct	28 ms	5100 KB	Output is correct
42	Correct	25 ms	4972 KB	Output is correct
43	Correct	28 ms	4972 KB	Output is correct
44	Correct	25 ms	4984 KB	Output is correct
45	Correct	32 ms	5100 KB	Output is correct
46	Correct	29 ms	4996 KB	Output is correct
47	Correct	33 ms	5120 KB	Output is correct
48	Correct	26 ms	5076 KB	Output is correct