Submission

Score: 0

User: singtoppy

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

Language: cpp

Time: 0.003 second

Submitted On: 2026-01-24 23:25:24

#include<bits/stdc++.h>

using namespace std;

#define pii pair<int, int>

const int N = 24;
const int INF = 1e9;

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

	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];
		}
	}

	//min spike and current count

	vector<vector<int>> p(n, vector<int>(m, INT_MIN));
	p[0][0] = v[0][0];

	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			if(i + 1 < n) 
				p[i + 1][j] = max(p[i + 1][j], p[i][j] + v[i + 1][j]);
			if(j + 1 < m) 
				p[i][j + 1] = max(p[i][j + 1], p[i][j] + v[i][j + 1]);
		}
	}

	vector<vector<int>> dp(n, vector<int>(m));
	dp[0][0] = v[0][0];

	for(int i = 1; i < n; i++) {
		dp[i][0] = min(min(p[i][0], 0), dp[i - 1][0]);
	}
	for(int i = 1; i < m; i++) {
		dp[0][i] = min(min(p[0][i], 0), dp[0][i - 1]);
	}

	for(int i = 1; i < n; i++) {
		for(int j = 1; j < m; j++) {
			dp[i][j] = min(min(p[i][j], 0), max(dp[i - 1][j], dp[i][j - 1]));
		}
	}

	int ans = dp[n - 1][m - 1];
	if(ans > 0) {
		cout << 0 << '\n';
	}
	else {
		cout << abs(ans) + 1 << '\n';
	}
}