oj.uz

Submission #37906

# Submission time Handle Problem Language Result Execution time Memory
37906 2017-12-29T02:28:09 Z Talant K blocks (IZhO14_blocks) C++14
0 / 100
 1000 ms 11404 KB 
#include <bits/stdc++.h>

#define fr first
#define sc second
#define OK puts("OK");
#define pb push_back
#define mk make_pair

using namespace std;

typedef long long ll;

const int inf = (int)1e9 + 7;
const int N = (int)1e5 + 2;

int n,kk;
int dp[2][N];
int a[N];
int t[21][N];

void buildtable() {
        for (int i = 0; i <= log2(n); i ++) {
                for (int j = 1; j <= n; j ++) {
                        if (i == 0) {
                                t[i][j] = a[j];
                                continue;
                        }
                        t[i][j] = max(t[i - 1][j],t[i - 1][j + (1 << (i - 1))]);
                }
        }
}
int get (int l,int r) {
        int cur = log2(r - l + 1);
        return max(t[cur][l],t[cur][r - (1 << cur) + 1]);
}
void compute (int k,int l,int r,int L,int R) {
        if (l > r)
                return;

        int m = (r + l) / 2;
        int opt = -1;
        dp[k & 1][m] = inf;
        int &d = dp[k & 1][m];

        for (int i = L; i <= min(m,R); i ++) {
                int now = dp[(k & 1) ^ 1][i - 1] + get(i,m);
                if (now < d)
                        d = now,opt = i;
        }
        compute (k,l,m - 1,L,opt);
        compute (k,m + 1,r,opt,R);
}
main () {
        cin >> n >> kk;

        for (int i = 1; i <= n; i ++)
                cin >> a[i];

        buildtable();

        for (int i = 1; i <= n; i ++)
                dp[1][i] = get(1,i);

        for (int i = 2; i <= kk; i ++)
                compute (i,i,n,i,n);

        cout << dp[kk & 1][n] << endl;
}

Compilation message

blocks.cpp:53:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 11404 KB Output is correct
2 Correct 0 ms 11404 KB Output is correct
3 Correct 0 ms 11404 KB Output is correct
4 Correct 0 ms 11404 KB Output is correct
5 Correct 0 ms 11404 KB Output is correct
6 Correct 0 ms 11404 KB Output is correct
7 Correct 0 ms 11404 KB Output is correct
8 Correct 0 ms 11404 KB Output is correct
9 Correct 0 ms 11404 KB Output is correct
10 Correct 0 ms 11404 KB Output is correct
11 Incorrect 0 ms 11404 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 11404 KB Output is correct
2 Correct 0 ms 11404 KB Output is correct
3 Correct 0 ms 11404 KB Output is correct
4 Correct 0 ms 11404 KB Output is correct
5 Correct 0 ms 11404 KB Output is correct
6 Correct 0 ms 11404 KB Output is correct
7 Correct 0 ms 11404 KB Output is correct
8 Correct 0 ms 11404 KB Output is correct
9 Correct 0 ms 11404 KB Output is correct
10 Correct 0 ms 11404 KB Output is correct
11 Incorrect 0 ms 11404 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 11404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 159 ms 11404 KB Output is correct
2 Correct 16 ms 11404 KB Output is correct
3 Correct 163 ms 11404 KB Output is correct
4 Execution timed out 1000 ms 11404 KB Execution timed out
5 Halted 0 ms 0 KB -