oj.uz

Submission #942158

# Submission time Handle Problem Language Result Execution time Memory
942158 2024-03-10T10:19:58 Z dsyz Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
0 / 100
 17 ms 476 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	ll N;
	cin>>N;
	ll arr[N], A[N];
	for(ll i = 0;i < N;i++){
		cin>>arr[i];
		A[i] = arr[i];
	}
	ll ans = 1e18;
	for(ll split = 0;split < N;split++){
		ll total = 0;
		ll Ldiff = 0,Rdiff = 0;
		for(ll i = 1;i <= split;i++){
			total += max(0ll,(arr[i - 1] + 1) - arr[i]);
			Ldiff += max(0ll,(arr[i - 1] + 1) - arr[i]);
			arr[i] = max(arr[i],arr[i - 1] + 1);
		}
		for(ll i = N - 2;i >= split;i--){
			total += max(0ll,(arr[i + 1] + 1) - arr[i]);
			Rdiff += max(0ll,(arr[i + 1] + 1) - arr[i]);
			arr[i] = max(arr[i],arr[i + 1] + 1);
		}
		total -= min(Ldiff,Rdiff);
		ans = min(ans,total);
		for(ll i = 0;i < N;i++){
			arr[i] = A[i]; //reset
		}
	}
	cout<<ans<<'\n';
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory 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 Incorrect 17 ms 476 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 60.0

# Verdict Execution time Memory 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 Incorrect 17 ms 476 KB Output isn't correct
6 Halted 0 ms 0 KB -