Submission

Score: 0

User: Ninstroyer

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

Language: cpp

Time: 0.076 second

Submitted On: 2026-01-03 15:53:47

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

const int nx = 1005, inf = -1e9;

int n,m,arr[nx][nx]; pair<int,int> dp[nx][nx];
vector<pair<int,int>> dir = {{0,1},{1,0}};

int main()
{
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n>>m;
    for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) cin>>arr[i][j], dp[i][j] = {inf,inf};
    dp[1][1] = {arr[1][1],arr[1][1]};
    queue<pair<int,int>> q;
    q.push({1,1});
    while(!q.empty())
    {
        auto [r,c] = q.front();
        auto [cur, mn] = dp[r][c];
        q.pop();
        for(auto [rr,cc] : dir)
        {
            int dr = r+rr;
            int dc = c+cc;
            if(dr>n||dc>m) continue;
            if(min(mn, cur + arr[dr][dc]) > dp[dr][dc].second)
            {
                dp[dr][dc].second = min(mn, cur + arr[dr][dc]);
                dp[dr][dc].first = cur + arr[dr][dc];
                q.push({dr,dc});
            }
        }
    }

    cout<<-min(0,dp[n][m].second)+1;
}