답안 #870669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
870669	2023-11-08T19:18:32 Z	Marco_Escandon	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++11	100 / 100	61 ms	5420 KB

Main

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
    ll n;
    cin>>n;
    ll cad[n];
    ll ac[n];
    ll ma=0;
    for(int i=0; i<n; i++)
    {
        cin>>cad[i];
        ac[i]=max(ma-cad[i],0LL);
        ma=cad[i]+1;
        if(i>0)
            ac[i]+=ac[i-1];
    }
    ll bs=1e17+7;
    ll sol=0;
    ma=0;
    for(int i=n-1; i>=0; i--)
    {
        sol+=max(ma-cad[i],0LL);
        ma=cad[i]+1;
        bs=min(bs,max(sol,ac[i]));
    }
    cout<<bs;
}

Subtask #1

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	476 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	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	448 KB	Output is correct
13	Correct	1 ms	444 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	480 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	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 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

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 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	476 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	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	1 ms	448 KB	Output is correct
13	Correct	1 ms	444 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	480 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	344 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 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	344 KB	Output is correct
26	Correct	55 ms	5204 KB	Output is correct
27	Correct	55 ms	5200 KB	Output is correct
28	Correct	61 ms	5200 KB	Output is correct
29	Correct	58 ms	5228 KB	Output is correct
30	Correct	48 ms	4688 KB	Output is correct
31	Correct	57 ms	5200 KB	Output is correct
32	Correct	57 ms	5200 KB	Output is correct
33	Correct	56 ms	5068 KB	Output is correct
34	Correct	57 ms	4984 KB	Output is correct
35	Correct	45 ms	4944 KB	Output is correct
36	Correct	42 ms	4792 KB	Output is correct
37	Correct	43 ms	4692 KB	Output is correct
38	Correct	55 ms	5032 KB	Output is correct
39	Correct	59 ms	5204 KB	Output is correct
40	Correct	61 ms	5420 KB	Output is correct
41	Correct	56 ms	5200 KB	Output is correct
42	Correct	52 ms	5200 KB	Output is correct
43	Correct	56 ms	5108 KB	Output is correct
44	Correct	54 ms	4944 KB	Output is correct
45	Correct	56 ms	5200 KB	Output is correct
46	Correct	57 ms	5112 KB	Output is correct
47	Correct	56 ms	5116 KB	Output is correct
48	Correct	56 ms	5196 KB	Output is correct