Submission #960898

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
960898	2024-04-11T07:56:27 Z	happy_node	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	21 ms	9068 KB

Main

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

const int MX=2e5+5;
int N;
ll A[MX], B[MX], C[MX], pf[MX], sf[MX];

int main() {
	cin.tie(0); ios_base::sync_with_stdio(0);

	cin>>N;
	for(int i=1;i<=N;i++) {
		cin>>A[i];
		B[i]=A[i]-A[i-1];
	}
	B[N+1]=A[N+1]-A[N];
	for(int i=1;i<=N+1;i++) {
		pf[i]+=pf[i-1];
		if(B[i]<=0) 
			pf[i]+=1-B[i];
	}
	for(int i=N;i>=1;i--) {
		sf[i]+=sf[i+1];
		if(B[i+1]>=0) 	
			sf[i]+=B[i+1]+1;
	}
	ll ans=pf[N];
	for(int i=1;i<=N;i++) {
		ans=min(ans,max(pf[i],sf[i]));
	}
	cout<<ans<<'\n';
}

Subtask #1

40.0 / 40.0

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

Subtask #2

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2396 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2392 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2524 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2392 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	21 ms	8916 KB	Output is correct
27	Correct	19 ms	8972 KB	Output is correct
28	Correct	18 ms	8896 KB	Output is correct
29	Correct	19 ms	9052 KB	Output is correct
30	Correct	15 ms	8284 KB	Output is correct
31	Correct	20 ms	8844 KB	Output is correct
32	Correct	18 ms	9052 KB	Output is correct
33	Correct	18 ms	8900 KB	Output is correct
34	Correct	18 ms	9012 KB	Output is correct
35	Correct	15 ms	8188 KB	Output is correct
36	Correct	16 ms	8284 KB	Output is correct
37	Correct	16 ms	8160 KB	Output is correct
38	Correct	18 ms	9040 KB	Output is correct
39	Correct	18 ms	9048 KB	Output is correct
40	Correct	18 ms	8932 KB	Output is correct
41	Correct	18 ms	9052 KB	Output is correct
42	Correct	20 ms	8792 KB	Output is correct
43	Correct	18 ms	8976 KB	Output is correct
44	Correct	18 ms	8784 KB	Output is correct
45	Correct	19 ms	9068 KB	Output is correct
46	Correct	19 ms	8920 KB	Output is correct
47	Correct	19 ms	8936 KB	Output is correct
48	Correct	18 ms	9032 KB	Output is correct