Commit too slow solution

maxi0604 · Dec 14, 2023 · a251b73 · a251b73
1 parent a3d02ed
commit a251b73
Show file tree

Hide file tree

Showing 2 changed files with 33 additions and 3 deletions.
diff --git a/d12/justfile b/d12/justfile
@@ -11,12 +11,12 @@ run:
 
 example:
     just build
-    < p1in.txt just run | less
+    < p1in.txt just run
 
 debug:
     just build
-    DEBUG=1 < p1in.txt just run | less
+    DEBUG=1 < p1in.txt just run
 
 trace:
     just build
-    TRACE=1 < p1in.txt just run | less
+    TRACE=1 < p1in.txt just run
diff --git a/d12/main.ts b/d12/main.ts
@@ -7,6 +7,8 @@ const term = rl.createInterface({
     output: process.stdout,
 })
 
+let dp: Map<string, number> = new Map();
+
 function debug(obj: any) {
     if (env.DEBUG || env.TRACE)
         console.log("\t".repeat(indentLevel) + obj);
@@ -53,7 +55,17 @@ function checkCovered(field: string, nums: number[], stack: number[]) {
 }
 
 let indentLevel = 0;
+
 function recurse(nums: number[], numIdx: number, field: string, idx: number, stack: number[]) {
+    let dpKey = `${numIdx}|${idx}`;
+
+    let dpRes = dp.get(dpKey);
+
+    if (dpRes) { // im severely dpRes-sed
+        debug(`dp hit: ${dpRes} at ${idx} with len = ${nums[numIdx]}`);
+        return dpRes;
+    }
+
     if (nums.length == numIdx) {
         debug("checking final.");
         return checkCovered(field, nums, stack) ? 1 : 0;
@@ -71,6 +83,8 @@ function recurse(nums: number[], numIdx: number, field: string, idx: number, sta
             count += sub;
         }
     }
+
+    dp.set(dpKey, count);
     return count;
 }
 
@@ -82,12 +96,28 @@ function doTheThing(lines: string[]) {
         const nums = split[1].split(",").map(x => Number(x));
         let springs = split[0];
         let stack: number[] = [];
+        dp = new Map();
         // springs = ".............................................................." +  springs + "...................................................................";
         let res = recurse(nums, 0, springs, 0, stack);
         console.log(`${line} ${res}`);
         sum += res;
     }
     console.log(`sum: ${sum}`);
+
+    console.log("p2");
+    let sum2 = 0;
+    for (const line of lines) {
+        const split = line.trim().split(" ").filter(i => i);
+        const nums = Array(5).fill(split[1].split(",").map(x => Number(x))).flat();
+        let springs = Array(5).fill(split[0]).join("?");
+        console.log(springs, nums);
+        let stack: number[] = [];
+        dp = new Map();
+        let res = recurse(nums, 0, springs, 0, stack);
+        console.log(`${springs} ${nums} ${res}`);
+        sum2 += res;
+    }
+    console.log(`sum2: ${sum2}`);
 }
 
 let lines: string[] = [];