Submission

[PPPP-SSSSSSSSSS]

Score: 0

User: osensunny

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

Language: cpp

Time: 0.003 second

Submitted On: 2025-03-22 20:56:05

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

#define int long long
#define vi vector<int>
#define vvi vector<vi>

int N, M, arr[1005][1005], dp[1005][1005], mnHP[1005][1005];

signed main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL);
	
	cin >> N >> M;
	for(int i=1; i<=N; i++){
		for(int j=1; j<=M; j++){
			cin >> arr[i][j];
		}
	}
	
	for(int i=1; i<=N; i++){
		for(int j=1; j<=M; j++){
			if(i == 1 && j == 1){
				dp[i][j] = arr[i][j];
				mnHP[i][j] = arr[i][j];
			}
			else if(i == 1){
				dp[i][j] = arr[i][j] + dp[i][j-1];
				mnHP[i][j] = min(mnHP[i][j-1], dp[i][j]);
			}
			else if(j == 1){
				dp[i][j] = arr[i][j] + dp[i-1][j];
				mnHP[i][j] = min(mnHP[i-1][j], dp[i][j]);
			}
			else if(i == M && j == N){
				mnHP[i][j] = max(mnHP[i-1][j], mnHP[i][j-1]);
			}
			else{
				if(dp[i-1][j] > dp[i][j-1]){
					dp[i][j] = arr[i][j] + dp[i-1][j];
					mnHP[i][j] = min(mnHP[i-1][j], dp[i][j]);
				}
				else{
					dp[i][j] = arr[i][j] + dp[i][j-1];
					mnHP[i][j] = min(mnHP[i][j-1], dp[i][j]);
				}
			}
		}
	}

	if(mnHP[N][M] > 0) cout << 0;
	else cout << abs(mnHP[N][M]) + 1;
	
	return 0;
}