Submission

Score: 100

User: s0m30n3

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

Language: cpp

Time: 0.055 second

Submitted On: 2026-03-18 14:57:53

#include <bits/stdc++.h>
using namespace std;

int table[1005][1005];
int dp[1005][1005];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m;
    if (!(cin >> n >> m)) return 0;

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

    for (int i = n; i >= 1; i--) {
        for (int j = m; j >= 1; j--) {
            if (i == n && j == m) {
                dp[i][j] = max(1, 1 - table[i][j]);
            } else {
                int res = 2e9; 
                if (i + 1 <= n) res = min(res, dp[i + 1][j]); 
                if (j + 1 <= m) res = min(res, dp[i][j + 1]); 
                
                dp[i][j] = max(1, res - table[i][j]);
            }
        }
    }
    cout << dp[1][1] << endl;
    return 0;
}