SMMR-092: Boss Room

#include <bits/stdc++.h>

using namespace std;
const int N = 1e3;
const int INF = 2e9;
int ar[N+10][N+10];
int dp[N+10][N+10];

int cost(int i, int j){
    return 5000 + i*500 - dp[i][j];
}

int main(){

    int n, m;
    scanf("%d%d", &n, &m);

    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            scanf("%d", &ar[i][j]);
            dp[i][j] = INF;
        }
    }

    for(int j = 1; j <= m; j ++){
        if(ar[1][j] >= 5000) continue;
        dp[1][j] = ar[1][j];
    }

    for(int i=2;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(j > 1 and cost(i-1, j-1) - ar[i][j] > 0 and dp[i-1][j-1] != INF){
                dp[i][j] = dp[i-1][j-1] + ar[i][j];
            }
            if(j < m and cost(i-1, j+1) - ar[i][j] > 0 and dp[i-1][j+1] != INF and dp[i-1][j+1] + ar[i][j] < dp[i][j]){
                dp[i][j] = dp[i-1][j+1] + ar[i][j];
            }
            if(cost(i-1, j) - ar[i][j] > 0 and dp[i-1][j] != INF and dp[i-1][j] + ar[i][j] < dp[i][j]){
                dp[i][j] = dp[i-1][j] + ar[i][j];
            }
        }
    }

    int mn = INF;
    for(int j=1;j<=m;j++) mn = min(mn, dp[n][j]);

    if(mn == INF) printf("-1");
    else printf("%d", mn);

    return 0;
}