Submission #814054

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
814054	2023-08-08T05:15:33 Z	MohamedAhmed04	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	25 ms	6136 KB

Main

#include <bits/stdc++.h>

using namespace std ;

const int MAX = 2e5 + 10 ;

int arr[MAX] ;
int n ;

long long pref[MAX] , suff[MAX] ;

int main()
{
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n ;
	for(int i = 1 ; i <= n ; ++i)
		cin>>arr[i] ;
	for(int i = 2 ; i <= n ; ++i)
		pref[i] = pref[i-1] + max(0 , arr[i-1] + 1 - arr[i]) ;
	for(int i = n-1 ; i >= 1 ; --i)
		suff[i] = suff[i+1] + max(0 , arr[i+1] + 1 - arr[i]) ;
	long long ans = 4e18 ;
	for(int i = 1 ; i <= n ; ++i)
		ans = min(ans , max(pref[i] , suff[i])) ;
	return cout<<ans<<"\n" , 0 ;
}		

Subtask #1

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	344 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	356 KB	Output is correct
17	Correct	1 ms	464 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	364 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	1 ms	340 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	344 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	356 KB	Output is correct
17	Correct	1 ms	464 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	364 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	25 ms	6036 KB	Output is correct
27	Correct	19 ms	6072 KB	Output is correct
28	Correct	18 ms	6100 KB	Output is correct
29	Correct	18 ms	6100 KB	Output is correct
30	Correct	15 ms	5460 KB	Output is correct
31	Correct	18 ms	6068 KB	Output is correct
32	Correct	19 ms	6060 KB	Output is correct
33	Correct	18 ms	6136 KB	Output is correct
34	Correct	24 ms	6116 KB	Output is correct
35	Correct	15 ms	5312 KB	Output is correct
36	Correct	18 ms	5460 KB	Output is correct
37	Correct	18 ms	5420 KB	Output is correct
38	Correct	18 ms	6116 KB	Output is correct
39	Correct	18 ms	6124 KB	Output is correct
40	Correct	18 ms	6048 KB	Output is correct
41	Correct	19 ms	6100 KB	Output is correct
42	Correct	17 ms	5880 KB	Output is correct
43	Correct	18 ms	6088 KB	Output is correct
44	Correct	18 ms	6100 KB	Output is correct
45	Correct	18 ms	6060 KB	Output is correct
46	Correct	18 ms	6116 KB	Output is correct
47	Correct	18 ms	6096 KB	Output is correct
48	Correct	18 ms	6104 KB	Output is correct