oj.uz

Submission #58751

# Submission time Handle Problem Language Result Execution time Memory
58751 2018-07-19T08:57:07 Z TAMREF None (JOI16_ho_t1) C++11
100 / 100
 146 ms 5868 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int mx = 2e5, mlgx = log2(mx)+1;
const ll inf = 1e16;

ll D[mx];
ll A[mx];
int n, m;
ll k;

ll tmax[mlgx][mx];
ll tmin[mlgx][mx];
int tlg[mx];

inline ll rMq_rmq(int s, int e){
    int lev = tlg[e-s+1];
    ll RMQ = max(tmax[lev][s], tmax[lev][e-(1<<lev)+1]);
    ll rmq = min(tmin[lev][s], tmin[lev][e-(1<<lev)+1]);
    //printf("RMQ,rmq(%d,%d) = (%lld,%lld)\n",s,e,RMQ,rmq);
    //printf("probe 1 = %d, probe 2 = %d\n",s,e-(1<<lev));
    return RMQ-rmq;
}

void input(){
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i++){
        cin >> A[i];
    }
    for(int i = 1; i <= n; i++){
        int j = 0;
        while((1<<j+1) <= i) ++j;
        tlg[i] = j;
    }
    copy(A+1,A+n+1,tmax[0]+1);
    copy(A+1,A+n+1,tmin[0]+1);

    for(int l = 1, b = 1; (1<<l) <= n; l++, b <<= 1){
        for(int i = 0; i + b <= n; i++){
            tmax[l][i] = max(tmax[l-1][i], tmax[l-1][i+b]);
            tmin[l][i] = min(tmin[l-1][i], tmin[l-1][i+b]);
        }
    }
}

void dp(){
    for(int i = 1; i <= n; i++){
        D[i] = inf;
        ll tmp;
        for(int j = max(0,i-m); j < i; j++){
            tmp = k + rMq_rmq(j+1,i) * (i - j);
            D[i] = min(D[i], D[j] + tmp);
        }
    }
    cout << D[n] << '\n';
}

void debug(){
    puts("tmax");
    for(int l = 0; (1<<l) <= n; l++){
        for(int i = 0; i <= n; i++){
            printf("%lld ",tmax[l][i]);
        }
        puts("");
    }
    puts("tmin");
    for(int l = 0; (1<<l) <= n; l++){
        for(int i = 0; i <= n; i++){
            printf("%lld ",tmin[l][i]);
        }
        puts("");
    }
    puts("dp");
    for(int i = 1; i <= n; i++){
        printf("%lld ",D[i]);
    }
    puts("");
}

int main(){
    //freopen("sample.txt","rt",stdin);
    ios_base::sync_with_stdio(false);cin.tie(0);
    input();
    dp();
    //debug();
}

Compilation message

2016_ho_t1.cpp: In function 'void input()':
2016_ho_t1.cpp:33:20: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
         while((1<<j+1) <= i) ++j;
                   ~^~

Subtask #1
20.0 / 20.0

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

Subtask #2
50.0 / 50.0

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

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 688 KB Output is correct
4 Correct 2 ms 688 KB Output is correct
5 Correct 2 ms 688 KB Output is correct
6 Correct 2 ms 688 KB Output is correct
7 Correct 3 ms 688 KB Output is correct
8 Correct 2 ms 688 KB Output is correct
9 Correct 3 ms 688 KB Output is correct
10 Correct 3 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 2 ms 688 KB Output is correct
13 Correct 2 ms 688 KB Output is correct
14 Correct 2 ms 688 KB Output is correct
15 Correct 3 ms 700 KB Output is correct
16 Correct 5 ms 1088 KB Output is correct
17 Correct 4 ms 1088 KB Output is correct
18 Correct 4 ms 1088 KB Output is correct
19 Correct 4 ms 1088 KB Output is correct
20 Correct 4 ms 1088 KB Output is correct
21 Correct 4 ms 1092 KB Output is correct
22 Correct 4 ms 1092 KB Output is correct
23 Correct 4 ms 1092 KB Output is correct
24 Correct 3 ms 1092 KB Output is correct
25 Correct 6 ms 1092 KB Output is correct
26 Correct 4 ms 1092 KB Output is correct
27 Correct 4 ms 1092 KB Output is correct
28 Correct 3 ms 1092 KB Output is correct
29 Correct 5 ms 1092 KB Output is correct
30 Correct 4 ms 1092 KB Output is correct
31 Correct 70 ms 5568 KB Output is correct
32 Correct 54 ms 5612 KB Output is correct
33 Correct 146 ms 5828 KB Output is correct
34 Correct 146 ms 5828 KB Output is correct
35 Correct 68 ms 5868 KB Output is correct
36 Correct 107 ms 5868 KB Output is correct
37 Correct 129 ms 5868 KB Output is correct
38 Correct 106 ms 5868 KB Output is correct
39 Correct 128 ms 5868 KB Output is correct
40 Correct 116 ms 5868 KB Output is correct
41 Correct 70 ms 5868 KB Output is correct
42 Correct 119 ms 5868 KB Output is correct
43 Correct 71 ms 5868 KB Output is correct
44 Correct 87 ms 5868 KB Output is correct
45 Correct 68 ms 5868 KB Output is correct