Submission

Score: 100

User: faofao

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

Language: cpp

Time: 0.075 second

Submitted On: 2026-03-12 10:14:08

#include <bits/stdc++.h>
using namespace std;
const int mxN = 1001 ;
int grid[mxN][mxN] ;
int dp[mxN][mxN] ;
int n,m ;

int main(){
    ios::sync_with_stdio(0),cin.tie(0) ;
    cin >> n >> m ;
    for(int i=0 ; i<n ; i++){
        for(int j=0 ; j<m ; j++){
            cin >> grid[i][j] ;
        }
    }
    dp[n-1][m-1] = max(1,1-grid[n-1][m-1]) ;
    for(int i=n-1 ; i>=0 ; i--){
        for(int j=m-1 ; j>=0 ; j--){
            if(i==n-1 && j==m-1) continue;
            int r = INT_MAX;
            int d = INT_MAX;

            if(i+1<n) d = dp[i+1][j] ;
            if(j+1<m) r = dp[i][j+1] ;

            dp[i][j] = max(1,min(r,d)-grid[i][j]) ;
        }
    }
    cout << dp[0][0] << "\n";
}