Submission #936902

# Submission time Handle Problem Language Result Execution time Memory
936902 2024-03-03T02:06:36 Z emanIaicepsa Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
0 / 100
1 ms 512 KB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);
template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}

signed main(){
    ios::sync_with_stdio(0), cin.tie(0);
    int N;
    cin >> N;
    vector<ll> arr(N), cost(N), costR(N);
    for (auto &i: arr) cin >> i;

    cost[0] = 0;
    for (int i = 1; i < N; i++) {
        if (arr[i] > arr[i - 1]) cost[i] = cost[i - 1];
        else cost[i] = cost[i - 1] + (arr[i - 1] - arr[i]) + 1;
    }

    costR[N - 1] = 0;
    for (int i = N - 2; i >= 0; i--) {
        if (arr[i] > arr[i + 1]) costR[i] = costR[i + 1];
        else costR[i] = costR[i + 1] + (arr[i + 1] - arr[i]) + 1;
    }

    ll answer = 1e18;
    for (int i = 0; i < N - 1; i++) {
        answer = min(answer, max(cost[i], costR[i]));
    }
    cout << answer << '\n';


}
# 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 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 408 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -
# 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 1 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 408 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -