Submission #737131

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
737131	2023-05-06T16:47:09 Z	tch1cherin	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++17	100 / 100	89 ms	6192 KB

Main

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

int main() {
  int N;
  cin >> N;
  vector<int> A(N);
  for (int &v : A) {
    cin >> v;
  }
  vector<long long> pref(N), suff(N);
  for (int i = 0; i < N - 1; i++) {
    pref[i + 1] = pref[i] + max(0, A[i] - A[i + 1] + 1);  
  }
  for (int i = N - 2; i >= 0; i--) {
    suff[i] = suff[i + 1] + max(0, A[i + 1] - A[i] + 1);
  }
  long long ans = LLONG_MAX;
  for (int i = 0; i < N; i++) {
    ans = min(ans, max(pref[i], suff[i]));
  }
  cout << ans << "\n";
}

Subtask #1

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	1 ms	296 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	1 ms	304 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	2 ms	316 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Correct	1 ms	312 KB	Output is correct
13	Correct	1 ms	304 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	308 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	324 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct

Subtask #2

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	296 KB	Output is correct
2	Correct	1 ms	296 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	2 ms	340 KB	Output is correct
6	Correct	1 ms	304 KB	Output is correct
7	Correct	1 ms	308 KB	Output is correct
8	Correct	2 ms	316 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	2 ms	340 KB	Output is correct
12	Correct	1 ms	312 KB	Output is correct
13	Correct	1 ms	304 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	308 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	308 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	324 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	2 ms	340 KB	Output is correct
26	Correct	81 ms	6092 KB	Output is correct
27	Correct	82 ms	6048 KB	Output is correct
28	Correct	84 ms	6092 KB	Output is correct
29	Correct	89 ms	6044 KB	Output is correct
30	Correct	62 ms	5452 KB	Output is correct
31	Correct	82 ms	6048 KB	Output is correct
32	Correct	83 ms	6068 KB	Output is correct
33	Correct	82 ms	6064 KB	Output is correct
34	Correct	82 ms	6192 KB	Output is correct
35	Correct	59 ms	5276 KB	Output is correct
36	Correct	62 ms	5412 KB	Output is correct
37	Correct	59 ms	5408 KB	Output is correct
38	Correct	77 ms	6052 KB	Output is correct
39	Correct	81 ms	6064 KB	Output is correct
40	Correct	83 ms	6092 KB	Output is correct
41	Correct	81 ms	6052 KB	Output is correct
42	Correct	79 ms	5916 KB	Output is correct
43	Correct	82 ms	6048 KB	Output is correct
44	Correct	77 ms	6048 KB	Output is correct
45	Correct	82 ms	6044 KB	Output is correct
46	Correct	83 ms	6044 KB	Output is correct
47	Correct	83 ms	6056 KB	Output is correct
48	Correct	81 ms	6048 KB	Output is correct