Submission #699075

# Submission time Handle Problem Language Result Execution time Memory
699075 2023-02-15T14:39:05 Z jiahng Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
96 ms 7188 KB
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
#define int ll
typedef pair<int, int> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair <pi,pi> pipi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 1000010
#define INF (ll)1e18
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;
#define DEBUG 0
#pragma GCC optimize("trapv")

int N,Q,w;
int ss[maxn],suff[maxn],A[maxn];

int32_t main(){
    cin >> N;
    FOR(i,1,N) cin >> A[i];
    FOR(i,2,N) ss[i] = ss[i-1] + max(0LL, A[i-1] + 1 - A[i]);
    DEC(i,N-1,1) suff[i] = suff[i+1] + max(0LL, A[i+1] + 1 - A[i]);

    int ans = INF;
    FOR(k,1,N) ans = min(ans, max(ss[k],suff[k]));
    cout << ans;

}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 2 ms 324 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 2 ms 324 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 1 ms 352 KB Output is correct
25 Correct 1 ms 352 KB Output is correct
26 Correct 79 ms 6836 KB Output is correct
27 Correct 77 ms 6872 KB Output is correct
28 Correct 82 ms 6872 KB Output is correct
29 Correct 83 ms 6980 KB Output is correct
30 Correct 75 ms 6216 KB Output is correct
31 Correct 82 ms 6852 KB Output is correct
32 Correct 89 ms 6872 KB Output is correct
33 Correct 78 ms 6928 KB Output is correct
34 Correct 82 ms 7032 KB Output is correct
35 Correct 55 ms 6128 KB Output is correct
36 Correct 61 ms 6188 KB Output is correct
37 Correct 60 ms 6192 KB Output is correct
38 Correct 79 ms 6816 KB Output is correct
39 Correct 88 ms 7188 KB Output is correct
40 Correct 80 ms 6892 KB Output is correct
41 Correct 78 ms 6912 KB Output is correct
42 Correct 96 ms 6732 KB Output is correct
43 Correct 82 ms 6948 KB Output is correct
44 Correct 79 ms 6848 KB Output is correct
45 Correct 76 ms 6860 KB Output is correct
46 Correct 84 ms 6964 KB Output is correct
47 Correct 91 ms 6860 KB Output is correct
48 Correct 78 ms 6908 KB Output is correct