Submission #828895

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
828895	2023-08-17T18:45:11 Z	raphaelp	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	70 ms	3020 KB

Main

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N;
    cin >> N;
    vector<int> A(N);
    for (int i = 0; i < N; i++)
    {
        cin >> A[i];
    }
    long long tot = 0;
    int a = 1, b = N - 2, adda = 0, addb = 0;
    while (a <= b)
    {
        while (A[a - 1] - adda < A[a])
        {
            a++;
            adda = 0;
        }
        while (A[b + 1] - addb < A[b])
        {
            b--;
            addb = 0;
        }
        if (a > b)
            break;
        int m = min(A[a - 1] - A[a] + 1 - adda, A[b + 1] - A[b] + 1 - addb);
        adda += m;
        addb += m;
        tot += m;
    }
    if (A[a] == A[b] && a == b + 1)
        tot++;
    cout << tot;
}

Subtask #1

40.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	2 ms	212 KB	Output is correct
18	Correct	1 ms	232 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	324 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	316 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct

Subtask #2

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	312 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	308 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	2 ms	212 KB	Output is correct
18	Correct	1 ms	232 KB	Output is correct
19	Correct	1 ms	312 KB	Output is correct
20	Correct	1 ms	324 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	316 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	324 KB	Output is correct
26	Correct	59 ms	2976 KB	Output is correct
27	Correct	58 ms	2984 KB	Output is correct
28	Correct	70 ms	2988 KB	Output is correct
29	Correct	56 ms	2976 KB	Output is correct
30	Correct	41 ms	2356 KB	Output is correct
31	Correct	61 ms	2988 KB	Output is correct
32	Correct	61 ms	2980 KB	Output is correct
33	Correct	57 ms	3020 KB	Output is correct
34	Correct	56 ms	3020 KB	Output is correct
35	Correct	40 ms	2124 KB	Output is correct
36	Correct	42 ms	2220 KB	Output is correct
37	Correct	42 ms	2208 KB	Output is correct
38	Correct	57 ms	2988 KB	Output is correct
39	Correct	57 ms	3020 KB	Output is correct
40	Correct	56 ms	2980 KB	Output is correct
41	Correct	57 ms	2996 KB	Output is correct
42	Correct	53 ms	2764 KB	Output is correct
43	Correct	57 ms	2976 KB	Output is correct
44	Correct	56 ms	2984 KB	Output is correct
45	Correct	56 ms	2984 KB	Output is correct
46	Correct	57 ms	3020 KB	Output is correct
47	Correct	57 ms	2980 KB	Output is correct
48	Correct	58 ms	2980 KB	Output is correct