답안 #932000

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
932000	2024-02-22T18:59:33 Z	Aiperiii	Growing Vegetables is Fun 4 (JOI21_ho_t1)	C++14	100 / 100	85 ms	7344 KB

Main

#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define pb push_back
using namespace std;
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    vector <int> a(n);
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    vector <int> pr(n),sf(n);
    for(int i=1;i<n;i++){
        pr[i]=pr[i-1];
        if(a[i-1]>=a[i])pr[i]+=a[i-1]-a[i]+1;
    }
    for(int i=n-2;i>=0;i--){
        sf[i]=sf[i+1];
        if(a[i+1]>=a[i])sf[i]+=a[i+1]-a[i]+1;
    }
    int ans=1e18;
    for(int i=0;i<n;i++){
        ans=min(ans,max(sf[i],pr[i]));
    }
    cout<<ans;
}

Subtask #1

40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	688 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 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	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	424 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 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	356 KB	Output is correct
17	Correct	1 ms	468 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	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	448 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	464 KB	Output is correct

Subtask #2

60.0 / 60.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	688 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 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	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	424 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	344 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 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	356 KB	Output is correct
17	Correct	1 ms	468 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	604 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	448 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	464 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Correct	53 ms	6980 KB	Output is correct
27	Correct	61 ms	6996 KB	Output is correct
28	Correct	62 ms	6836 KB	Output is correct
29	Correct	58 ms	7000 KB	Output is correct
30	Correct	57 ms	6228 KB	Output is correct
31	Correct	55 ms	6964 KB	Output is correct
32	Correct	85 ms	7344 KB	Output is correct
33	Correct	56 ms	6996 KB	Output is correct
34	Correct	56 ms	6968 KB	Output is correct
35	Correct	37 ms	6084 KB	Output is correct
36	Correct	39 ms	6340 KB	Output is correct
37	Correct	43 ms	6588 KB	Output is correct
38	Correct	56 ms	6848 KB	Output is correct
39	Correct	54 ms	6996 KB	Output is correct
40	Correct	56 ms	6992 KB	Output is correct
41	Correct	54 ms	6960 KB	Output is correct
42	Correct	60 ms	6868 KB	Output is correct
43	Correct	55 ms	6996 KB	Output is correct
44	Correct	52 ms	7000 KB	Output is correct
45	Correct	54 ms	6992 KB	Output is correct
46	Correct	82 ms	7012 KB	Output is correct
47	Correct	53 ms	6840 KB	Output is correct
48	Correct	71 ms	6852 KB	Output is correct