Submission

Score: 0

User: robgornpeunpadpairoundnigumaipadnea

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

Language: cpp

Time: 0.002 second

Submitted On: 2026-03-14 21:22:12

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

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int n,m;cin>>n>>m;
    vector<vector<int>> v(n,vector<int>(m));
    for(int i=0;i<n;i++)for(int j=0;j<m;j++)cin>>v[i][j];

    int ans[n][m];
    ans[n-1][m-1] = max(1,1-v[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 hpwant = min(ans[i+1][j],ans[i][j+1]);
            ans[i][j] = max(1,hpwant-v[i][j]);   
        }
    }
    cout << ans[0][0];
}