Submission #942165

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
942165	2024-03-10T10:27:01 Z	dsyz	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	20 ms	7004 KB

Main

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	ll N;
	cin>>N;
	ll arr[N];
	for(ll i = 0;i < N;i++){
		cin>>arr[i];
	}
	ll ans = 1e18;
	ll prefix[N];
	ll Ldiff = 0;
	for(ll i = 0;i < N;i++){
		if(i >= 1) Ldiff += max(0ll,(arr[i - 1] + 1) - arr[i]);
		prefix[i] = Ldiff;
	}
	ll suffix[N];
	ll Rdiff = 0;
	for(ll i = N - 1;i >= 0;i--){
		if(i < N - 1) Rdiff += max(0ll,(arr[i + 1] + 1) - arr[i]);
		suffix[i] = Rdiff;
	}
	for(ll split = 0;split < N;split++){
		ll total = max(prefix[split],suffix[split]);
		ans = min(ans,total);
	}
	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	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	472 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 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	0 ms	348 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	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	344 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	472 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	1 ms	348 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	0 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	18 ms	6360 KB	Output is correct
27	Correct	18 ms	6856 KB	Output is correct
28	Correct	18 ms	7004 KB	Output is correct
29	Correct	18 ms	6984 KB	Output is correct
30	Correct	14 ms	6236 KB	Output is correct
31	Correct	18 ms	7004 KB	Output is correct
32	Correct	18 ms	6972 KB	Output is correct
33	Correct	18 ms	6992 KB	Output is correct
34	Correct	17 ms	7004 KB	Output is correct
35	Correct	14 ms	6292 KB	Output is correct
36	Correct	15 ms	6236 KB	Output is correct
37	Correct	14 ms	6172 KB	Output is correct
38	Correct	17 ms	7004 KB	Output is correct
39	Correct	18 ms	7004 KB	Output is correct
40	Correct	20 ms	6996 KB	Output is correct
41	Correct	17 ms	6996 KB	Output is correct
42	Correct	17 ms	6748 KB	Output is correct
43	Correct	18 ms	6996 KB	Output is correct
44	Correct	18 ms	7000 KB	Output is correct
45	Correct	19 ms	6996 KB	Output is correct
46	Correct	18 ms	6992 KB	Output is correct
47	Correct	18 ms	6868 KB	Output is correct
48	Correct	17 ms	6984 KB	Output is correct