Submission #966082

# Submission time Handle Problem Language Result Execution time Memory
966082 2024-04-19T11:05:46 Z oblantis Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
24 ms 10244 KB
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
//#pragma GCC optimize("O3,unroll-loops")
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define pb push_back
#define ss second
#define ff first
#define vt vector
#define uid(a, b) uniform_int_distribution<int>(a, b)(mt)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int inf = 2e9;
const int mod = 1e9+7;
const int maxn = 1e6;
mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
void solve() {
    int n;
    cin >> n;
    ll a[n], p[n], s[n], x[n], y[n];
    for(int i = 0; i < n; i++){
        cin >> a[i];
        p[i] = s[i] = 0;
    }
    for(int i = 0; i < n; i++){
        if(i)p[i] = p[i - 1] + max(0ll, a[i - 1] + 1 - a[i]);
        x[i] = a[i] + p[i];
    }
    ll t = 0;
    for(int i = n - 1; i >= 0; i--){
        t = max(t, a[i]);
        if((i + 1) < n)s[i] = s[i + 1] + max(0ll, a[i + 1] + 1 - a[i]);
        y[i] = t++;
    }
    ll ans = min(p[n - 1], s[0]);
    for(int i = 0; i < n - 1; i++){
        ans = min(max(p[i], s[i + 1]) + (p[i] == s[i + 1] && x[i] == y[i + 1]), ans);
    }
    cout << ans;
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int times = 1; //cin >> times;
	for(int i = 1; i <= times; i++) {
		solve();
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 476 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 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 1 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 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 476 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 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 1 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 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 19 ms 10188 KB Output is correct
27 Correct 20 ms 10076 KB Output is correct
28 Correct 19 ms 10244 KB Output is correct
29 Correct 19 ms 10072 KB Output is correct
30 Correct 17 ms 9308 KB Output is correct
31 Correct 20 ms 10076 KB Output is correct
32 Correct 19 ms 10076 KB Output is correct
33 Correct 20 ms 10180 KB Output is correct
34 Correct 20 ms 10076 KB Output is correct
35 Correct 16 ms 9412 KB Output is correct
36 Correct 16 ms 9308 KB Output is correct
37 Correct 19 ms 9308 KB Output is correct
38 Correct 24 ms 10076 KB Output is correct
39 Correct 20 ms 10076 KB Output is correct
40 Correct 20 ms 10076 KB Output is correct
41 Correct 19 ms 10076 KB Output is correct
42 Correct 20 ms 9808 KB Output is correct
43 Correct 20 ms 10064 KB Output is correct
44 Correct 22 ms 10076 KB Output is correct
45 Correct 20 ms 10192 KB Output is correct
46 Correct 19 ms 10068 KB Output is correct
47 Correct 20 ms 10076 KB Output is correct
48 Correct 20 ms 10076 KB Output is correct