-
Notifications
You must be signed in to change notification settings - Fork 0
/
a.test.ts
79 lines (64 loc) · 2.02 KB
/
a.test.ts
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
import { expect, test } from "bun:test";
function zip<T>(arr: T[][]): T[][] {
const result: T[][] = [];
for (let i = 0; i < arr[0].length; i++) {
result.push(arr.map((a) => a[i]));
}
return result;
}
function solution(input: string) {
const grid = input.split("\n").map((line) => line.split(""));
const emptyRows = new Set();
for (let i = 0; i < grid.length; i++) {
const isEmpty = grid[i].every((ch) => ch === ".");
if (isEmpty) {
emptyRows.add(i);
}
}
const emptyCols = new Set();
const zipped = zip(grid);
for (let i = 0; i < zipped.length; i++) {
const isEmpty = zipped[i].every((ch) => ch === ".");
if (isEmpty) {
emptyCols.add(i);
}
}
const galaxies = [];
for (let i = 0; i < grid.length; i++) {
for (let j = 0; j < grid[0].length; j++) {
const ch = grid[i][j];
if (ch === "#") {
galaxies.push({ row: i, col: j });
}
}
}
let ans = 0;
const scale = 2;
for (let i = 0; i < galaxies.length; i++) {
for (let j = i + 1; j < galaxies.length; j++) {
const g1 = galaxies[i];
const g2 = galaxies[j];
for (let k = Math.min(g1.row, g2.row); k < Math.max(g1.row, g2.row); k++) {
ans += emptyRows.has(k) ? scale : 1;
}
for (let k = Math.min(g1.col, g2.col); k < Math.max(g1.col, g2.col); k++) {
ans += emptyCols.has(k) ? scale : 1;
}
}
}
return ans;
}
test("example", async () => {
const file = Bun.file(`${import.meta.dir}/example.txt`);
const input = await file.text();
const actual = solution(input);
const expected = 374;
expect(actual).toBe(expected);
});
test("puzzle input", async () => {
const file = Bun.file(`${import.meta.dir}/input.txt`);
const input = await file.text();
const actual = solution(input);
const expected = 9974721;
expect(actual).toBe(expected);
});