Submission #977727

# Submission time Handle Problem Language Result Execution time Memory
977727 2024-05-08T10:07:39 Z LOLOLO Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
25 ms 5124 KB
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
 
#define           f    first
#define           s    second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 5e5 + 100;
int a[N], f[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n; 

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        f[i] = a[i] - a[i - 1];
    }

    ll l = 0, r = 0;
    for (int i = 2; i <= n; i++) {
        if (f[i] >= 0) {
            r += f[i] + 1;
        }
    }

    ll ans = r;

    for (int i = 2; i <= n; i++) {
        if (f[i] >= 0) {
            r -= (f[i] + 1);
        } 

        if (f[i] <= 0) {
            l += (abs(f[i]) + 1);
        }

        ans = min(ans, l + r - min(l, r));
    }

    cout << ans << '\n';
    return 0;
}


// a[l] += 1
// a[r + 1] -= 
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2540 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2512 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2560 KB Output is correct
20 Correct 2 ms 2528 KB Output is correct
21 Correct 1 ms 2540 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 2 ms 2396 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2540 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2512 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2560 KB Output is correct
20 Correct 2 ms 2528 KB Output is correct
21 Correct 1 ms 2540 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 1 ms 2552 KB Output is correct
25 Correct 1 ms 2392 KB Output is correct
26 Correct 20 ms 5124 KB Output is correct
27 Correct 23 ms 5052 KB Output is correct
28 Correct 21 ms 4896 KB Output is correct
29 Correct 20 ms 5068 KB Output is correct
30 Correct 20 ms 4448 KB Output is correct
31 Correct 17 ms 4992 KB Output is correct
32 Correct 16 ms 4952 KB Output is correct
33 Correct 19 ms 5012 KB Output is correct
34 Correct 21 ms 4956 KB Output is correct
35 Correct 15 ms 4188 KB Output is correct
36 Correct 16 ms 4452 KB Output is correct
37 Correct 20 ms 4372 KB Output is correct
38 Correct 25 ms 5080 KB Output is correct
39 Correct 20 ms 5036 KB Output is correct
40 Correct 16 ms 4952 KB Output is correct
41 Correct 17 ms 4880 KB Output is correct
42 Correct 18 ms 4956 KB Output is correct
43 Correct 16 ms 4952 KB Output is correct
44 Correct 19 ms 5044 KB Output is correct
45 Correct 16 ms 4956 KB Output is correct
46 Correct 16 ms 5100 KB Output is correct
47 Correct 25 ms 4948 KB Output is correct
48 Correct 17 ms 5032 KB Output is correct