oj.uz

답안 #639641

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639641 2022-09-10T19:00:58 Z Pietra Rabbit Carrot (LMIO19_triusis) C++14
14 / 100
 655 ms 98440 KB 
// pra cada cara a gnt sabe o intervalo q ele pode precisar
// v[i] - m (sair dele p esse) ou
// dp[i][s] -> min qtd de descidas q eu preciso
// p com s subidas chegar em i
// tem um intervalo p cada cara mas isso depende dos anteriores
// dp[i][alt] = min de ops q eu preciso fzr para que esteja ok
// chegar em i com o ultimo tendo altura alt
#include<bits/stdc++.h>
using namespace std ;

const int maxn = 5e3 + 5 ;
const int maxx = 20 ;

int n, m, v[maxx], dp[maxn][maxn] ;

int solve(int i, int alt){
   // cout << i << " " << alt << "\n" ;
    if(i > n) return 0 ;
    if(dp[i][alt] != -1) return dp[i][alt] ;
    int ans = maxn ;
    for(int j = 0 ; j <= alt + min(m, maxn) ; j++){
        if(v[i] == j) ans = min(ans, solve(i+1, j)) ;
        else ans = min(ans, solve(i+1, j) + 1) ;
    }
    return dp[i][alt] = ans ;
}

int main(){

    ios_base::sync_with_stdio(false) ; cin.tie(NULL) ;

    cin >> n >> m ;

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

    memset(dp, -1, sizeof dp) ;

    cout << solve(1, 0) << "\n" ;

}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 98252 KB Output is correct
2 Correct 35 ms 98252 KB Output is correct
3 Correct 37 ms 98332 KB Output is correct
4 Correct 37 ms 98280 KB Output is correct
5 Correct 40 ms 98332 KB Output is correct
6 Correct 41 ms 98276 KB Output is correct
7 Correct 45 ms 98300 KB Output is correct
8 Correct 38 ms 98308 KB Output is correct
9 Correct 655 ms 98336 KB Output is correct
10 Correct 36 ms 98256 KB Output is correct
11 Correct 87 ms 98440 KB Output is correct
12 Correct 39 ms 98268 KB Output is correct
13 Correct 37 ms 98244 KB Output is correct
14 Correct 37 ms 98252 KB Output is correct
15 Correct 36 ms 98256 KB Output is correct
16 Correct 37 ms 98240 KB Output is correct

Subtask #2
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 98252 KB Output is correct
2 Correct 35 ms 98252 KB Output is correct
3 Correct 37 ms 98332 KB Output is correct
4 Correct 37 ms 98280 KB Output is correct
5 Correct 40 ms 98332 KB Output is correct
6 Correct 41 ms 98276 KB Output is correct
7 Correct 45 ms 98300 KB Output is correct
8 Correct 38 ms 98308 KB Output is correct
9 Correct 655 ms 98336 KB Output is correct
10 Correct 36 ms 98256 KB Output is correct
11 Correct 87 ms 98440 KB Output is correct
12 Correct 39 ms 98268 KB Output is correct
13 Correct 37 ms 98244 KB Output is correct
14 Correct 37 ms 98252 KB Output is correct
15 Correct 36 ms 98256 KB Output is correct
16 Correct 37 ms 98240 KB Output is correct
17 Correct 44 ms 98328 KB Output is correct
18 Correct 40 ms 98252 KB Output is correct
19 Correct 47 ms 98348 KB Output is correct
20 Incorrect 38 ms 98312 KB Output isn't correct
21 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 98328 KB Output is correct
2 Correct 40 ms 98252 KB Output is correct
3 Correct 47 ms 98348 KB Output is correct
4 Incorrect 38 ms 98312 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 98328 KB Output is correct
2 Correct 40 ms 98252 KB Output is correct
3 Correct 47 ms 98348 KB Output is correct
4 Incorrect 38 ms 98312 KB Output isn't correct
5 Halted 0 ms 0 KB -