cleaned solution
authorBrendan Hansen <brendan.f.hansen@gmail.com>
Thu, 16 Dec 2021 01:26:26 +0000 (19:26 -0600)
committerBrendan Hansen <brendan.f.hansen@gmail.com>
Thu, 16 Dec 2021 01:26:26 +0000 (19:26 -0600)
tests/aoc-2021/day15.onyx

index 28e81c668c3bd351891c387d0593743403dfbbde..bf1e2ebd54fe3d41f4d0e3fd7e1a8217d09787c5 100644 (file)
@@ -64,8 +64,9 @@ main :: (args) => {
             array.sort(to_try, (y,x) => x.cost - y.cost);
         }
 
-        printf("Part 2: {}\n", minimum);// - ~~(cells[0] - #char "0"));
-/*
+        printf("Part 2: {}\n", minimum);
+
+/*      NAIVE SOLUTION
         min_paths := array.make(u32, capacity=cells.count*25);
         min_paths.count = cells.count * 25;
         memory.set(min_paths.data, 0, sizeof u32 * min_paths.count * 25);