damn. 103/100. if I had just ignored the typescript error on .as and used it, I would have saved like a second or so which would have been enough to make it on the leaderboard for part 1

wow

also I've enabled es2021 now so I can use .at and ts won't complain

…or not
oh maybe I have to update ts. will do that in the next commit

Author: pfgithub

2021/solutions/day12/day12.1.ts

@@ -0,0 +1,70 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = `
+dc-end
+HN-start
+start-kj
+dc-start
+dc-HN
+LN-dc
+HN-end
+kj-sa
+kj-HN
+kj-dc
+`;
+// input = practice;
+input = input.trim();
+
+const system: {[key: string]: string[]} = {
+
+};
+
+input.split("\n").forEach(line => {
+    const [left, right] = line.split("-");
+    (system[left] ??= []).push(right);
+    (system[right] ??= []).push(left);
+});
+
+const unique_paths = new Set<string>();
+
+function isUppercase(a: string): boolean {
+    return a.toUpperCase() === a;
+}
+
+// visit small caves at most once, and can visit big caves any number of times
+function findPath(begin: string[]): string[] {
+    if(begin[begin.length - 1] === "end") {
+        return [begin.join(",")];
+    }
+
+    let choices = system[begin[begin.length-1]];
+
+    choices = choices.filter(c => {
+        if(isUppercase(c)) return true;
+        return !begin.includes(c);
+    });
+
+    return choices.flatMap((c) => findPath([...begin, c]));
+}
+
+console.log(findPath(["start"]).length); // expect=4338
+
+// input.
+
+// hi! i'm glad you're excited to code
+// but consider fully reading the problem statement first.
+// Sincerely, future you.

2021/solutions/day12/day12.2.ts

@@ -0,0 +1,85 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = `
+dc-end
+HN-start
+start-kj
+dc-start
+dc-HN
+LN-dc
+HN-end
+kj-sa
+kj-HN
+kj-dc
+`;
+// input = practice;
+input = input.trim();
+
+const system: {[key: string]: string[]} = {
+
+};
+
+input.split("\n").forEach(line => {
+    const [left, right] = line.split("-");
+    (system[left] ??= []).push(right);
+    (system[right] ??= []).push(left);
+});
+
+const unique_paths = new Set<string>();
+
+function isUppercase(a: string): boolean {
+    return a.toUpperCase() === a;
+}
+
+// visit small caves at most once, and can visit big caves any number of times
+function findPath(begin: string[]): string[] {
+    if(begin[begin.length - 1] === "end") {
+        return [begin.join(",")];
+    }
+
+    let choices = system[begin[begin.length-1]];
+
+    let has = new Set<string>();
+    let allowv = 2;
+    begin.some(v => {
+        if(isUppercase(v)) return false;
+        if(has.has(v)) {
+            allowv = 1;
+            return true;
+        }
+        has.add(v);
+        return false;
+    });
+    // console.log(begin, allowv);
+
+    choices = choices.filter(c => {
+        if(isUppercase(c)) return true;
+        if(c === "start") return false;
+        // check if begin has any item twice
+        return begin.filter(v => v === c).length < allowv;
+    });
+
+    return choices.flatMap((c) => findPath([...begin, c]));
+}
+
+findPath(["start"]).dwth(log).dwth(v => log(v.length)); // expect=114189
+
+// input.
+
+// hi! i'm glad you're excited to code
+// but consider fully reading the problem statement first.
+// Sincerely, future you.

2021/solutions/day12/day12.3.ts

@@ -0,0 +1,25 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = ``;
+// input = practice;
+input = input.trim();
+
+// input.
+
+// hi! i'm glad you're excited to code
+// but consider fully reading the problem statement first.
+// Sincerely, future you.

2021/solutions/day12/day12.4.ts

@@ -0,0 +1,25 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = ``;
+// input = practice;
+input = input.trim();
+
+// input.
+
+// hi! i'm glad you're excited to code
+// but consider fully reading the problem statement first.
+// Sincerely, future you.

2021/solutions/day12/day12.5.ts

@@ -0,0 +1,25 @@
+import {fhmain} from "../../../src/fheader";
+fhmain(__filename);
+/*
+input: string, lines: string[], dblines: string[][]
+copy(text: string) → clipboard
+error(message: string) → thrown error
+-5..mod(3) → @mod(-5, 3)
+*/
+
+// Cardinals:
+// [[1,0],[-1,0],[0,1],[0,-1]]
+// +Diagonals:
+// [[1,0],[-1,0],[0,1],[0,-1],[-1,-1],[-1,1],[1,-1],[1,1]]
+
+export {};
+
+const practice = ``;
+// input = practice;
+input = input.trim();
+
+// input.
+
+// hi! i'm glad you're excited to code
+// but consider fully reading the problem statement first.
+// Sincerely, future you.

2021/solutions/day12/day12.txt

@@ -0,0 +1,23 @@
+nu-start
+rt-start
+db-qh
+PE-end
+sl-rt
+qh-end
+ZH-rt
+nu-rt
+PE-db
+db-sl
+nu-ZH
+nu-qh
+PE-qh
+ZH-db
+ne-end
+ne-ZH
+QG-db
+qh-sl
+ZH-qh
+start-ZH
+nu-PE
+uf-db
+ne-sl

README.md

@@ -6,14 +6,15 @@
 
 ### 2021
 
-- Total Score: 52
-- Times On Leaderboard: 2 / 18 (~11%)
+- Total Score: 53
+- Times On Leaderboard: 3 / 20 (~15%)
 - Best Leaderboard Position: 62ⁿᵈ place
 - Worst Leaderboard Position: 1688ᵗʰ place
 - Best Day was Day 2: 39 points, #178/#62
 
 | Day |     Time | Rank | Score |     Time | Rank | Score |
 | --: | -------: | ---: | ----: | -------: | ---: | ----: |
+|  12 | 00:06:39 |  103 |       | 00:12:40 |  100 |     1 |
 |  11 | 00:15:41 |  755 |       | 00:17:44 |  682 |       |
 |  10 | 00:04:42 |  192 |       | 00:10:38 |  287 |       |
 |   9 | 00:03:33 |   88 |    13 | 00:28:33 | 1688 |       |

tsconfig.json

@@ -1,7 +1,7 @@
 {
 	"compilerOptions": {
 		"strict": true,
-		"lib": ["es2019"],
+		"lib": ["es2021"],
 		"target": "esnext"
 	}
 }