Submission

Score: 0

User: kakcode

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

Language: cpp

Time: 0.004 second

Submitted On: 2025-12-01 21:24:20

/*
TASK: อัศวินขี่ม้าขาว
LANG: C++
AUTHOR: ICE
*/
#include <bits/stdc++.h>
using ll = long long;
#define forr(i, a, n) for (int i = a; i < n; i++)
const ll inf = 10e9;
#define int ll
using namespace std;
using pii = pair<int,int>;
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m;
    cin >> n >> m;
    vector<vector<int>> arr(n+2,vector<int> (m+2,0));
    vector<vector<int>> dp(n+2,vector<int> (m+2,inf));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++)cin >> arr[i][j];
    }
    dp[n][m] = 1-arr[n][m];
    for(int i=n;i>=1;i--){
        for(int j=m;j>=1;j--){
            if(i == n && j == m) continue;
            dp[i][j] = max(1ll,min((dp[i+1][j]),(dp[i][j+1]))-arr[i][j]);
        }
    }
    cout << dp[1][1];
    
    return 0;
}