oj.uz

Submission #367614

# Submission time Handle Problem Language Result Execution time Memory
367614 2021-02-17T18:54:02 Z knightron0 K blocks (IZhO14_blocks) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double
 
const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
    int n, k;
    cin>>n>>k;
    int a[n+3];
    for(int i= 1;i<=n;i++){
        cin>>a[i];
    }
    int dp[n+3][k+3];
    clr(dp, 0);
    for(int i = 1;i<=n;i++) {
        dp[i][1] = max(dp[i-1][1], a[i]);
    }

    for(int j= 2;j<=k;j++){
        for(int i= 1;i<=n;i++){
            dp[i][j] = INF;
            if(i < j) continue;
            int mx = a[i];
            int x = -1;
            for(int ii =i-1;ii>=1;ii--){
                if(a[ii] >= a[i]){
                    x = ii;
                    mx = max(mx, a[ii]);
                    break;
                }
            }
            for(int ii = max(x, 1LL);ii<i;ii++){
                dp[i][j] = min(dp[ii][j-1]+a[i], dp[i][j]);
            }
            dp[i][j] = min(dp[max(x, 0LL)][j], dp[i][j]);
            // for(int ii = x-1;ii>=1;ii--){
            //     dp[i][j] = min(dp[ii][j-1]+mx, dp[i][j]);
            //     mx = max(mx, a[ii]);
            // }   
        }

    }
    cout<<dp[n][k]<<endl;
    return 0;
}

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 1 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Incorrect 0 ms 364 KB Output isn't correct
5 Halted 0 ms 0 KB -