Minimum Grid Path Sum in C++

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <stdexcept>
#include <cstdint>
#include <limits>
// Minimum Grid Path Sum in C++
//
// PURPOSE
// A minimum path through a cost grid combines optimal results from above and left when
// movement is restricted to right or down.
//
// METHOD
// Use one row of cumulative costs. Initialize the first row and column, then add each cell
// cost to the cheaper predecessor.
//
// COMPLEXITY
// O(rows * cols) time, O(cols) auxiliary space.
//
// CONTRACT
// rows,cols>=1. grid is a flattened matrix of nonnegative costs. All sums must fit signed
// 32-bit.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// C++17: const vector references for inputs, mutable references for outputs, RAII workspace,
// standard lower_bound for LIS. Invalid inputs throw invalid_argument; overflow throws
// overflow_error; allocation failure propagates bad_alloc.
//
// EXAMPLE
// Expected return: 7.
// Run: g++ -std=c++17 -O2 example.cpp -o example && ./example
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

static int alg_min(int a, int b) { return a < b ? a : b; }
static int alg_max(int a, int b) { return a > b ? a : b; }
static void alg_require(bool valid) { if (!valid) throw std::invalid_argument("invalid algorithm input"); }
static int alg_checked(int64_t v) { if (v < INT32_MIN || v > INT32_MAX) throw std::overflow_error("32-bit result overflow"); return (int)v; }
static int alg_add(int a,int b) { return alg_checked((int64_t)a+b); }
static int alg_sub(int a,int b) { return alg_checked((int64_t)a-b); }
static int alg_mul(int a,int b) { return alg_checked((int64_t)a*b); }
static size_t alg_size(int n) { alg_require(n>=0 && n<=4000000); return (size_t)n; }

int minimum_path_sum(const std::vector<int>& grid, int rows, int cols) {
    alg_require(grid.size() <= 1000000);
    alg_require(((int)grid.size() == alg_mul(rows, cols)));
    alg_require(((rows >= 1) && (cols >= 1) && (rows <= 1000000) && (cols <= 1000000)));
    std::vector<int> dp(alg_size(cols), 0);
    int r = 0;
    int c = 0;
    while ((r < rows)) {
        c = 0;
        while ((c < cols)) {
            if (((r == 0) && (c == 0))) {
                dp[c] = grid[0];
            } else {
                if ((r == 0)) {
                    dp[c] = alg_add(dp[alg_sub(c, 1)], grid[c]);
                } else {
                    if ((c == 0)) {
                        dp[c] = alg_add(dp[c], grid[alg_mul(r, cols)]);
                    } else {
                        dp[c] = alg_add(alg_min(dp[c], dp[alg_sub(c, 1)]), grid[alg_add(alg_mul(r, cols), c)]);
                    }
                }
            }
            c = alg_add(c, 1);
        }
        r = alg_add(r, 1);
    }
    return dp[alg_sub(cols, 1)];
}

int main(void) {
    std::vector<int> grid = {1, 3, 1, 1, 5, 1, 4, 2, 1};
    int rows = 3;
    int cols = 3;
    int result = minimum_path_sum(grid, rows, cols);
    printf("%d\n", result);
    return 0;
}