Submission

Score: 0

User: PIXIX

Problemset: อัศวินขี่ม้าขาว

Language: cpp

Time: 0.000 second

Submitted On: 2026-03-19 18:20:22

#include <climits>
#include <iostream>
using namespace std;

int solve(vector<vector<int>> &grid){
    int n = grid.size();
    int m = grid[0].size();
    vector<vector<int>> dp(n + 1,vector<int>(m + 1,INT_MAX));

    dp[n-1][m] = 1;
    dp[n][m-1] = 1;

    for(int i = n - 1 ; i >= 0 ; i--){
        for(int j = m - 1 ; j >= 0; j--){
            dp[i][j] = max(1,min(dp[i + 1][j], dp[i][j + 1]) - grid[i][j]);
        }
    }
    return dp[0][0];

}

int main (int argc, char *argv[]) {

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

    int n , m; cin>>n>>m;

    vector<vector<int>> grid(n,vector<int>(m,0));

    for(int i = 0; i < n;i++){
        for(int j = 0; j < m;j++){
            cin >> grid[i][j];
        }
    }

    cout << solve(grid);
}