Submission #941787

# Submission time Handle Problem Language Result Execution time Memory
941787 2024-03-09T12:09:48 Z Litusiano Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
67 ms 13012 KB
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int inf = 1e18;
signed main(){
	int n; cin>>n;
	vector<int> v(n); for(int& i : v) cin>>i;
	// for(int i : v) cout<<i<<" "; cout<<endl;
	vector<int> dp(n,inf), dp1(n,inf), mx(n+1,0), mx1(n+1,0);
	dp[0] = 0;
	mx[0] = 0;
	vector<int> last(n+1,0), last1(n+1,0); // just add max(between act and last)
	for(int i = 1; i<n; i++){
		// cerr<<i<<" "<<v[i-1]<<" "<<dp[i-1]<<" "<<mx[i-1]<<endl;
		if(v[i] > v[i-1]){
			dp[i] = dp[i-1]; continue;
		}
		dp[i] = dp[i-1] + max(0ll, abs(v[i] - v[i-1])) + 1;
	}
	dp1[n-1] = 0;
	mx1[n] = 0;
	for(int i = n-2; i>=0; i--){
		// cerr<<"dp1 "<<i<<" "<<v[i]<<" "<<dp1[i+1]<<" "<<mx1[i+1]<<" ";
		if(v[i] > v[i+1]){
			dp1[i] = dp1[i+1]; continue;
		}
		dp1[i] = dp1[i+1] + max(0ll,(v[i+1]- v[i])) + 1;
	}
	// mx1[n] = v[n-1]; mx[0] = v[0];
	// for(int i : mx1) cout<<i<<" "; cout<<endl;
	int ans = min(dp[n-1],dp1[0]);
	// cerr<<dp[n]<<" "<<dp1[0]<<endl;
	for(int i = 1; i<n; i++){
		// cerr<<dp[i]<<" "<<dp1[i]<<endl;
		ans = min(ans, max(dp[i], dp1[i]));
	}
	cout<<ans<<endl;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 448 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 468 KB Output is correct
11 Correct 1 ms 348 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 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 600 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 460 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 448 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 468 KB Output is correct
11 Correct 1 ms 348 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 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 600 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 460 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 62 ms 12664 KB Output is correct
27 Correct 62 ms 12624 KB Output is correct
28 Correct 62 ms 12624 KB Output is correct
29 Correct 61 ms 12468 KB Output is correct
30 Correct 53 ms 12368 KB Output is correct
31 Correct 60 ms 12428 KB Output is correct
32 Correct 62 ms 12608 KB Output is correct
33 Correct 60 ms 12516 KB Output is correct
34 Correct 62 ms 12604 KB Output is correct
35 Correct 44 ms 12084 KB Output is correct
36 Correct 46 ms 12372 KB Output is correct
37 Correct 46 ms 12268 KB Output is correct
38 Correct 63 ms 12584 KB Output is correct
39 Correct 60 ms 12624 KB Output is correct
40 Correct 64 ms 12624 KB Output is correct
41 Correct 61 ms 12636 KB Output is correct
42 Correct 62 ms 13012 KB Output is correct
43 Correct 60 ms 12628 KB Output is correct
44 Correct 61 ms 12664 KB Output is correct
45 Correct 67 ms 12612 KB Output is correct
46 Correct 60 ms 12624 KB Output is correct
47 Correct 60 ms 12504 KB Output is correct
48 Correct 61 ms 12468 KB Output is correct