oj.uz

Submission #983939

# Submission time Handle Problem Language Result Execution time Memory
983939 2024-05-16T08:18:58 Z vjudge1 Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
 27 ms 6276 KB 
//#pragma GCC optimize("Ofast,O3")
//#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
using namespace std;



#ifdef LOCAL
#include "debugger.cpp"
#else
#define debug(...)
#endif
template<class T>
int len(T &a){
    return a.size();
}

using ll = long long;
using pii = pair<int,int>;
#define all(a) (a).begin(), (a).end()
#define ff first
#define ss second
string fileio = "";

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll infl = 1e18;
const int maxn = 1e5 + 1;





void solve(){
    int n; cin >> n;
    vector<int> a(n);
    for(auto &u : a){
        cin >> u;
    }

    vector<ll> lef(n), rig(n);
    for(int i = 1; i < n; i ++){
        lef[i] = lef[i - 1] + max(0, a[i - 1] - a[i] + 1);
    }
    for(int i = n - 2; i>= 0; i --){
        rig[i] = rig[i + 1] + max(0, a[i + 1] - a[i] + 1);
    }
    ll ans = infl;
    for(int i = 0; i < n; i ++){
        ans = min(ans, max(lef[i], rig[i]));
    }
    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    auto start = chrono::high_resolution_clock::now();
    #ifndef LOCAL
    if(fileio.size()){
        freopen((fileio + ".in").c_str(), "r", stdin);
        freopen((fileio + ".out").c_str(), "w", stdout);
    }
    #endif
    int testcases = 1;
    #ifdef Tests
    cin >> testcases;
    #endif
    while(testcases --){
        solve();
        if(testcases) cout << '\n';
        #ifdef LOCAL
        else cout << '\n';
        cout << "_________________________" << endl;
        #endif
    }
    #ifdef LOCAL
    auto duration = chrono::duration_cast<chrono::microseconds>(chrono::high_resolution_clock::now() - start);
    
    cout << "time: " << (double)duration.count()/1000.0 << " milliseconds" << endl;
    #endif
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:58:10: warning: variable 'start' set but not used [-Wunused-but-set-variable]
   58 |     auto start = chrono::high_resolution_clock::now();
      |          ^~~~~
Main.cpp:61:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   61 |         freopen((fileio + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:62:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |         freopen((fileio + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
40.0 / 40.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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 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 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 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 1 ms 348 KB Output is correct
24 Correct 1 ms 484 KB Output is correct

Subtask #2
60.0 / 60.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 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 344 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 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 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 1 ms 348 KB Output is correct
24 Correct 1 ms 484 KB Output is correct
25 Correct 1 ms 484 KB Output is correct
26 Correct 18 ms 6236 KB Output is correct
27 Correct 20 ms 6236 KB Output is correct
28 Correct 18 ms 6236 KB Output is correct
29 Correct 17 ms 6236 KB Output is correct
30 Correct 14 ms 5464 KB Output is correct
31 Correct 22 ms 6068 KB Output is correct
32 Correct 20 ms 6228 KB Output is correct
33 Correct 21 ms 6276 KB Output is correct
34 Correct 18 ms 6236 KB Output is correct
35 Correct 16 ms 5488 KB Output is correct
36 Correct 14 ms 5468 KB Output is correct
37 Correct 14 ms 5468 KB Output is correct
38 Correct 21 ms 6232 KB Output is correct
39 Correct 18 ms 6228 KB Output is correct
40 Correct 17 ms 6236 KB Output is correct
41 Correct 17 ms 6236 KB Output is correct
42 Correct 17 ms 6100 KB Output is correct
43 Correct 18 ms 6228 KB Output is correct
44 Correct 17 ms 6224 KB Output is correct
45 Correct 17 ms 6168 KB Output is correct
46 Correct 27 ms 6100 KB Output is correct
47 Correct 19 ms 6228 KB Output is correct
48 Correct 23 ms 6236 KB Output is correct