oj.uz

Submission #396790

# Submission time Handle Problem Language Result Execution time Memory
396790 2021-04-30T18:37:01 Z duality Growing Vegetables is Fun 4 (JOI21_ho_t1) C++11
100 / 100
 41 ms 5364 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------

int A[200000],diff[200001];
LLI a[200000];
int main() {
    int i;
    int N;
    scanf("%d",&N);
    for (i = 0; i < N; i++) scanf("%d",&A[i]),diff[i] = A[i]-((i == 0) ? 0:A[i-1]);
    diff[N] = -A[N-1];

    LLI ans = 1e18;
    LLI s = 0;
    for (i = 0; i < N; i++) {
        s += max(-diff[i]+1,0);
        a[i] = s;
    }
    s = 0;
    for (i = N; i >= 1; i--) {
        s += max(diff[i]+1,0);
        ans = min(ans,max(s,a[i-1]));
    }
    printf("%lld\n",ans);

    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:63:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |     scanf("%d",&N);
      |     ~~~~~^~~~~~~~~
Main.cpp:64:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   64 |     for (i = 0; i < N; i++) scanf("%d",&A[i]),diff[i] = A[i]-((i == 0) ? 0:A[i-1]);
      |                             ~~~~~^~~~~~~~~~~~

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 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 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 2 ms 400 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 324 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 288 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 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 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 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 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 2 ms 400 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 308 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 324 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 288 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 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 32 ms 5316 KB Output is correct
27 Correct 32 ms 5236 KB Output is correct
28 Correct 41 ms 5300 KB Output is correct
29 Correct 30 ms 5288 KB Output is correct
30 Correct 27 ms 4684 KB Output is correct
31 Correct 33 ms 5252 KB Output is correct
32 Correct 30 ms 5292 KB Output is correct
33 Correct 30 ms 5312 KB Output is correct
34 Correct 32 ms 5292 KB Output is correct
35 Correct 32 ms 4528 KB Output is correct
36 Correct 25 ms 4568 KB Output is correct
37 Correct 26 ms 4636 KB Output is correct
38 Correct 32 ms 5304 KB Output is correct
39 Correct 30 ms 5312 KB Output is correct
40 Correct 31 ms 5352 KB Output is correct
41 Correct 29 ms 5328 KB Output is correct
42 Correct 39 ms 5120 KB Output is correct
43 Correct 30 ms 5336 KB Output is correct
44 Correct 29 ms 5188 KB Output is correct
45 Correct 30 ms 5312 KB Output is correct
46 Correct 30 ms 5236 KB Output is correct
47 Correct 30 ms 5352 KB Output is correct
48 Correct 30 ms 5364 KB Output is correct