oj.uz

Submission #90648

# Submission time Handle Problem Language Result Execution time Memory
90648 2018-12-23T08:53:28 Z popovicirobert K blocks (IZhO14_blocks) C++14
0 / 100
 96 ms 19312 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44

using namespace std;

const int INF = 1e9;
const int MAXN = (int) 1e5;
const int MAXK = 100;

int dp[MAXN + 1][MAXK + 1];
int arr[MAXN + 1];

int stk[MAXN + 1];
int mx[MAXN + 1];

int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, j, n, k;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> k;
    for(i = 1; i <= n; i++) {
        cin >> arr[i];
    }
    for(i = 1; i <= n; i++) {
        dp[i][1] = max(dp[i - 1][1], arr[i]);
    }
    dp[0][1] = INF;
    for(j = 2; j <= k; j++) {
        int sz = 0;
        dp[0][j] = mx[0] = INF;
        for(i = 1; i <= n; i++) {
            while(sz > 0 && arr[i] >= arr[stk[sz]]) {
                sz--;
            }
            stk[++sz] = i;
            mx[sz] = mx[sz - 1];
            if(i >= j) {
                mx[sz] = min(mx[sz], dp[max(j - 1, stk[sz - 1])][j - 1] + arr[i]);
            }
            dp[i][j] = mx[sz];
        }
    }
    cout << dp[n][k];
    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 4604 KB Output is correct
2 Correct 18 ms 18636 KB Output is correct
3 Correct 25 ms 18896 KB Output is correct
4 Incorrect 96 ms 19312 KB Output isn't correct
5 Halted 0 ms 0 KB -