Submission #942159

# Submission time Handle Problem Language Result Execution time Memory
942159 2024-03-10T10:20:43 Z dsyz Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
40 / 100
1000 ms 5464 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]);
		}
		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]);
		}
		total -= min(Ldiff,Rdiff);
		ans = min(ans,total);
	}
	cout<<ans<<'\n';
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:9:13: warning: variable 'A' set but not used [-Wunused-but-set-variable]
    9 |  ll arr[N], A[N];
      |             ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 6 ms 484 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 504 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 5 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 6 ms 484 KB Output is correct
6 Correct 6 ms 348 KB Output is correct
7 Correct 4 ms 348 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 4 ms 348 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 4 ms 344 KB Output is correct
16 Correct 4 ms 348 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 4 ms 348 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 4 ms 344 KB Output is correct
21 Correct 4 ms 348 KB Output is correct
22 Correct 4 ms 504 KB Output is correct
23 Correct 5 ms 348 KB Output is correct
24 Correct 5 ms 348 KB Output is correct
25 Correct 6 ms 348 KB Output is correct
26 Execution timed out 1006 ms 5464 KB Time limit exceeded
27 Halted 0 ms 0 KB -