oj.uz

Submission #535089

# Submission time Handle Problem Language Result Execution time Memory
535089 2022-03-09T11:40:25 Z browntoad Growing Vegetables is Fun 4 (JOI21_ho_t1) C++14
100 / 100
 33 ms 7040 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=1e6;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================
 

signed main (){
    IOS();
    int n; cin>>n;
    vector<int> vc(n), pf(n), sf(n);
    REP(i,n){
        cin>>vc[i];
    }
    int cur=0;
    REP(i,n){
        if (i==0) {
            pf[i]=0;
            cur=vc[i];
        }
        else {
            pf[i]=pf[i-1]+max(0ll, vc[i-1]-vc[i]+1);
        }
    }
    RREP(i,n){
        if (i==n-1){
            sf[i]=0;
            cur=vc[i];
        }
        else {
            sf[i]=sf[i+1]+max(0ll, vc[i+1]-vc[i]+1);
        }
    }
    int ans=inf;
    REP(i,n){
        ans=min(ans, max(pf[i], sf[i]));
    }
    cout<<ans<<endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:63:9: warning: variable 'cur' set but not used [-Wunused-but-set-variable]
   63 |     int cur=0;
      |         ^~~

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 332 KB Output is correct

Subtask #2
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 296 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 308 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 312 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 27 ms 6912 KB Output is correct
27 Correct 24 ms 6912 KB Output is correct
28 Correct 25 ms 6920 KB Output is correct
29 Correct 24 ms 6916 KB Output is correct
30 Correct 22 ms 6212 KB Output is correct
31 Correct 26 ms 6960 KB Output is correct
32 Correct 33 ms 7040 KB Output is correct
33 Correct 27 ms 6912 KB Output is correct
34 Correct 24 ms 6904 KB Output is correct
35 Correct 18 ms 6164 KB Output is correct
36 Correct 21 ms 6144 KB Output is correct
37 Correct 21 ms 6136 KB Output is correct
38 Correct 22 ms 6904 KB Output is correct
39 Correct 24 ms 6912 KB Output is correct
40 Correct 24 ms 6916 KB Output is correct
41 Correct 26 ms 6928 KB Output is correct
42 Correct 23 ms 6724 KB Output is correct
43 Correct 24 ms 6904 KB Output is correct
44 Correct 23 ms 6796 KB Output is correct
45 Correct 23 ms 6852 KB Output is correct
46 Correct 23 ms 6844 KB Output is correct
47 Correct 30 ms 6928 KB Output is correct
48 Correct 24 ms 6860 KB Output is correct