oj.uz

답안 #1009522

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1009522 2024-06-27T15:25:28 Z altern23 Stove (JOI18_stove) C++17
20 / 100
 17 ms 68956 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<ll,ll>
#define fi first
#define sec second

const ll MOD = 1e9 + 7;
const ll N = 5e3 + 5;
const ll INF = 1e18;

ll dp[N][N];

int32_t main(){
  cin.tie(0)->sync_with_stdio(0);
  int tc = 1;
  // cin >> tc;
  while(tc--){
    ll n,k; cin >> n >> k;
    vector<ll>vec(n+5);
    for(int i=1;i<=n;i++) cin >> vec[i];
    for(int i=1;i<=n;i++){
      for(int j=0;j<=k;j++){
        dp[i][j] = -INF;
      }
    }
    dp[0][0] = 0;
    for(int i=1;i<=n;i++){
      for(int j=0;j<k;j++){
        dp[i][j] = dp[i-1][j];
        if(j) dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] + (vec[i] - vec[i-1] - 1));
      }
    }
    cout << vec[n] - vec[1] + 1 - dp[n][k-1] << endl;
  }
}
/*
1 2 3 4 5
*/

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 460 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 7 ms 55132 KB Output is correct
11 Correct 8 ms 56408 KB Output is correct
12 Incorrect 17 ms 68956 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 460 KB Output is correct
10 Correct 7 ms 55132 KB Output is correct
11 Correct 8 ms 56408 KB Output is correct
12 Incorrect 17 ms 68956 KB Output isn't correct
13 Halted 0 ms 0 KB -