oj.uz

Submission #58739

# Submission time Handle Problem Language Result Execution time Memory
58739 2018-07-19T05:51:36 Z leejseo None (JOI16_ho_t1) C++
100 / 100
 85 ms 3600 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long lld;
const lld UNDEF = 1LL << 60;
const int MAXN = 20000;
int N, M;
lld K, A[MAXN+1], D[MAXN+1];

void input(){
    scanf("%d%d%lld", &N, &M, &K);
    for (int i=0; i<N; i++) scanf("%lld", &A[i+1]);
}

void DP(){
    D[0] = 0;
    for (int i=1; i<=N; i++){
        D[i] = D[i-1]+K;
        lld m1 = A[i], m2 = A[i];
        for (int k=i-1; k > max(0,i-M); k--){
            m1 = max(m1, A[k]), m2 = min(m2, A[k]);
            D[i] = min(D[i], D[k-1] + K + (i-k+1) * (m1 - m2));
        }
    }
    printf("%lld\n", D[N]);
}

int main(){
    input();
    DP();
}

Compilation message

2016_ho_t1.cpp: In function 'void input()':
2016_ho_t1.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%lld", &N, &M, &K);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
2016_ho_t1.cpp:11:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i=0; i<N; i++) scanf("%lld", &A[i+1]);
                             ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 3 ms 584 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 3 ms 636 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 636 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 3 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 4 ms 640 KB Output is correct
9 Correct 4 ms 640 KB Output is correct
10 Correct 4 ms 640 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 3 ms 640 KB Output is correct
13 Correct 3 ms 640 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 4 ms 640 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 3 ms 516 KB Output is correct
5 Correct 2 ms 548 KB Output is correct
6 Correct 3 ms 584 KB Output is correct
7 Correct 2 ms 592 KB Output is correct
8 Correct 2 ms 592 KB Output is correct
9 Correct 3 ms 620 KB Output is correct
10 Correct 3 ms 620 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 3 ms 620 KB Output is correct
13 Correct 2 ms 620 KB Output is correct
14 Correct 2 ms 620 KB Output is correct
15 Correct 3 ms 636 KB Output is correct
16 Correct 4 ms 636 KB Output is correct
17 Correct 5 ms 640 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 4 ms 640 KB Output is correct
20 Correct 3 ms 640 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 4 ms 640 KB Output is correct
23 Correct 4 ms 640 KB Output is correct
24 Correct 4 ms 640 KB Output is correct
25 Correct 4 ms 640 KB Output is correct
26 Correct 3 ms 640 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 3 ms 640 KB Output is correct
29 Correct 3 ms 640 KB Output is correct
30 Correct 4 ms 640 KB Output is correct
31 Correct 29 ms 1020 KB Output is correct
32 Correct 29 ms 1232 KB Output is correct
33 Correct 53 ms 1332 KB Output is correct
34 Correct 56 ms 1556 KB Output is correct
35 Correct 30 ms 1884 KB Output is correct
36 Correct 85 ms 2096 KB Output is correct
37 Correct 68 ms 2172 KB Output is correct
38 Correct 60 ms 2376 KB Output is correct
39 Correct 52 ms 2572 KB Output is correct
40 Correct 63 ms 2768 KB Output is correct
41 Correct 30 ms 2964 KB Output is correct
42 Correct 61 ms 3124 KB Output is correct
43 Correct 34 ms 3244 KB Output is correct
44 Correct 43 ms 3540 KB Output is correct
45 Correct 41 ms 3600 KB Output is correct