oj.uz

Submission #1090813

# Submission time Handle Problem Language Result Execution time Memory
1090813 2024-09-18T19:45:51 Z nguyennh K blocks (IZhO14_blocks) C++14
0 / 100
 0 ms 600 KB 
#include<bits/stdc++.h>
#define el '\n'
using namespace std ;
 
const int MN = 1e5 + 5;
const int64_t inf = 1e18;
 
int64_t a[MN];
 
int32_t main (){
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n , k;
  cin >> n >> k;
  for ( int i = 1 ; i <= n ; i++ ) cin >> a[i];
  vector<vector<int64_t>> dp(n + 5 , vector<int64_t>(k + 5 , inf));
  dp[0][0] = 0;
  for ( int i = 1 ; i <= n ; i++ ){
    int64_t mx = 0;
    // for ( int j = i ; j >= 1 ; j-- ){
    //   mx = max(mx , a[j]);
    //   for ( int l = 0 ; l <= k ; l++ ){
    //     dp[i][l + 1] = min(dp[i][l + 1] , dp[j - 1][l] + mx);
    //   }
    // }
    int pos = 1;
    for (int j = i ; j >= 1 ; j--){
      if (a[j] > a[i]){
        pos = j;
        break;
      }
    }
    for (int j = i ; j >= pos ; j--){
      mx = max(mx , a[j]);
      for (int l = 0 ; l <= k ; l++){
        dp[i][l + 1] = min(dp[i][l + 1] , dp[j - 1][l] + mx);
      }
    }
  }
  cout << dp[n][k];
}

Subtask #1
0 / 14.0

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

Subtask #2
0 / 18.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 47.0

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