Submission #875207

# Submission time Handle Problem Language Result Execution time Memory
875207 2023-11-18T19:11:15 Z makrav Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
20 ms 7256 KB
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<int> vei;
typedef vector<vei> vevei;

#define all(a) (a).begin(), (a).end()
#define sz(a) (int) a.size()
#define con cout << "NO\n"
#define coe cout << "YES\n";
#define str string
#define pb push_back
#define ff first
#define sc second
#define ss second
#define pii pair<int, int>
#define mxe max_element
#define mne min_element
#define stf shrink_to_fit
#define f(i, l, r) for (int i = (l); i < (r); i++)
#define double ld
#define int ll

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n; cin >> n;
    vector<int> a(n);
    f(i, 0, n) cin >> a[i];

    vector<int> pref(n + 1, 0);
    for (int i = 2; i <= n; i++) {
        pref[i] = pref[i - 1] + (a[i - 1] > a[i - 2] ? 0 : a[i - 2] - a[i - 1] + 1);
    }
    vector<int> suff(n + 1, 0);
    for (int i = 2; i <= n; i++) {
        suff[i] = suff[i - 1] + (a[n - i] > a[n - i + 1] ? 0 : a[n - i + 1] - a[n - i] + 1);
    }
    int ans = 1e18;
    f(i, 0, n) {
        ans = min(ans, max(pref[i + 1], suff[n - i]));
    }
    cout << ans << '\n';

    return 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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
# 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 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 19 ms 6996 KB Output is correct
27 Correct 19 ms 6992 KB Output is correct
28 Correct 20 ms 7020 KB Output is correct
29 Correct 18 ms 7060 KB Output is correct
30 Correct 14 ms 6236 KB Output is correct
31 Correct 18 ms 7004 KB Output is correct
32 Correct 18 ms 6880 KB Output is correct
33 Correct 18 ms 7004 KB Output is correct
34 Correct 19 ms 7004 KB Output is correct
35 Correct 14 ms 6236 KB Output is correct
36 Correct 15 ms 6236 KB Output is correct
37 Correct 17 ms 6600 KB Output is correct
38 Correct 18 ms 7256 KB Output is correct
39 Correct 18 ms 6996 KB Output is correct
40 Correct 18 ms 7016 KB Output is correct
41 Correct 18 ms 7004 KB Output is correct
42 Correct 17 ms 6740 KB Output is correct
43 Correct 18 ms 6996 KB Output is correct
44 Correct 18 ms 7016 KB Output is correct
45 Correct 18 ms 7244 KB Output is correct
46 Correct 17 ms 6996 KB Output is correct
47 Correct 18 ms 7004 KB Output is correct
48 Correct 18 ms 7012 KB Output is correct