oj.uz

Submission #388167

# Submission time Handle Problem Language Result Execution time Memory
388167 2021-04-10T10:38:22 Z BartolM Growing Vegetables is Fun 4 (JOI21_ho_t1) C++17
100 / 100
 33 ms 8492 KB 
#define DEBUG 1
#include <bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;

const int INF=0x3f3f3f3f;
const int N=2e5+5;

int n;
ll p[N], pref[N], suff[N];
ll br[N];

void solve() {
    br[0]=p[0]; pref[0]=0;
    for (int i=1; i<n; ++i) {
        br[i]=max(p[i]+pref[i-1], br[i-1]+1);
        pref[i]=max(pref[i-1], br[i]-p[i]);
    }
    br[n-1]=p[n-1]; suff[n-1]=0;
    for (int i=n-2; i>=0; --i) {
        br[i]=max(p[i]+suff[i+1], br[i+1]+1);
        suff[i]=max(suff[i+1], br[i]-p[i]);
    }
    ll sol=(ll)INF*INF;
    for (int i=0; i<n; ++i) sol=min(sol, max(pref[i], suff[i]));
    printf("%lld\n", sol);
}

void load() {
    scanf("%d", &n);
    for (int i=0; i<n; ++i) scanf("%lld", p+i);
}

int main() {
    load();
    solve();
    return 0;
}

Compilation message

Main.cpp: In function 'void load()':
Main.cpp:40:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   40 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
Main.cpp:41:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   41 |     for (int i=0; i<n; ++i) scanf("%lld", p+i);
      |                             ~~~~~^~~~~~~~~~~~~

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 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 332 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 336 KB Output is correct
23 Correct 1 ms 332 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 204 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 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 332 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 336 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 31 ms 8412 KB Output is correct
27 Correct 32 ms 8412 KB Output is correct
28 Correct 30 ms 8388 KB Output is correct
29 Correct 31 ms 8400 KB Output is correct
30 Correct 30 ms 7708 KB Output is correct
31 Correct 31 ms 8408 KB Output is correct
32 Correct 31 ms 8404 KB Output is correct
33 Correct 32 ms 8388 KB Output is correct
34 Correct 30 ms 8468 KB Output is correct
35 Correct 26 ms 7588 KB Output is correct
36 Correct 26 ms 7748 KB Output is correct
37 Correct 29 ms 7784 KB Output is correct
38 Correct 30 ms 8360 KB Output is correct
39 Correct 32 ms 8488 KB Output is correct
40 Correct 30 ms 8420 KB Output is correct
41 Correct 32 ms 8412 KB Output is correct
42 Correct 31 ms 8280 KB Output is correct
43 Correct 30 ms 8492 KB Output is correct
44 Correct 30 ms 8388 KB Output is correct
45 Correct 33 ms 8412 KB Output is correct
46 Correct 31 ms 8464 KB Output is correct
47 Correct 31 ms 8472 KB Output is correct
48 Correct 31 ms 8432 KB Output is correct