giles
c69a7694c8
Test, Build, and Deploy / test-build-deploy (push) Failing after 22s
ocaml: phase 5.1 min_cost_path.ml baseline (4x4 grid DP, optimal cost 12)
Standard 2D DP for min-cost path with right/down moves only:
dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + cost[i][j]
cost: dp:
1 3 1 2 1 4 5 7
1 5 1 3 2 7 6 9
4 2 1 4 6 8 7 11
1 6 2 3 7 13 9 12
Optimal cost from (0,0) to (3,3) = 12.
Tests nested 2D arrays via Array.init + Array.make, double-nested
for-loops with branched edges (first row, first column, general),
mixed .(i-1).(j) read + .(i).(j)<- write on the same DP array.
161 baseline programs total.
2026-05-10 22:37:44 +00:00
..
2026-05-07 19:33:09 +00:00
2026-05-06 23:00:12 +00:00
2026-05-06 22:01:51 +00:00
2026-05-01 23:30:48 +00:00
2026-05-07 19:45:10 +00:00
2026-05-06 22:46:48 +00:00
2026-05-07 01:20:32 +00:00
2026-05-01 22:33:27 +00:00
2026-05-07 17:17:17 +00:00
2026-05-10 22:37:44 +00:00
2026-05-07 17:35:49 +00:00
2026-05-01 23:18:04 +00:00
2026-05-06 22:01:51 +00:00
2026-05-07 18:29:26 +00:00
2026-04-02 12:50:35 +00:00
2026-04-03 21:48:54 +00:00
2026-04-03 21:48:54 +00:00
2026-05-07 02:38:47 +00:00
2026-04-03 21:48:54 +00:00
2026-05-06 16:58:18 +00:00
2026-04-04 20:49:02 +00:00
2026-04-22 09:08:00 +00:00
2026-04-22 09:08:00 +00:00
2026-04-04 20:49:02 +00:00
2026-04-11 08:03:45 +00:00
2026-05-01 21:00:22 +00:00
2026-04-03 21:48:54 +00:00
2026-04-11 08:19:16 +00:00
2026-04-03 21:48:54 +00:00
2026-04-04 20:49:02 +00:00
2026-04-12 18:31:34 +00:00
2026-04-04 20:49:02 +00:00
2026-04-04 20:49:02 +00:00
2026-04-08 10:12:57 +00:00