Submission

Score: 0

User: hyyh

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

Language: cpp

Time: 0.154 second

Submitted On: 2026-01-12 23:11:16

#include <iostream>
#include <math.h>
#include <vector>
#include <string>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <iomanip>
#include <set>
#include <bitset>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
using piii = tuple<int,int,int>;
#define endl '\n'
#define f first
#define s second

int const diaphantineequationformutidimentionalcalculation = 1010;

int dp[diaphantineequationformutidimentionalcalculation][diaphantineequationformutidimentionalcalculation];
int dp2[diaphantineequationformutidimentionalcalculation][diaphantineequationformutidimentionalcalculation];

int main(){
    for(int i = 0;i < diaphantineequationformutidimentionalcalculation;i++){
        for(int j = 0;j < diaphantineequationformutidimentionalcalculation;j++){
            dp[i][j] = -1e9;
            dp2[i][j] = -1e9;
        }
    }
    dp[0][1] = 0;
    dp[1][0] = 0;
    dp2[0][1] = 0;
    dp2[1][0] = 0;
    int n,m;cin >> n >> m;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            int g;cin >> g;
            dp[i][j] = max(dp[i-1][j],dp[i][j-1]) + g;
            //cout << dp[i][j] << " ";
        }
        //cout << endl;
    }
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            int g;cin >> g;
            dp2[i][j] = min(dp[i][j],max(dp2[i-1][j],dp2[i][j-1]));
            //cout << dp2[i][j] << " ";
        }
        //cout << endl;
    }
    cout << -dp2[n][m]+1;
}