-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathd13.ts
80 lines (70 loc) · 2 KB
/
d13.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
80
import { loopSum } from '../utils/loop'
const vertical = (
input: string[],
ignore: number | null,
i: number | null,
): number | null => {
if (input.length === 0) return i
const [f, ...r] = input
if (i === null) {
for (let j = 0; j < f.length - 1; ++j) {
if (j === ignore) continue
const o = vertical(input, ignore, j)
if (o !== null) return o
}
return null
} else {
const a = f.slice(0, i + 1)
const b = f
.slice(i + 1, input[0].length)
.split('')
.reverse()
.join('')
return a.endsWith(b) || b.endsWith(a) ? vertical(r, ignore, i) : null
}
}
// Rotates the pattern 90 degrees clockwise
const rotate = (input: string[]): string[] =>
Array.from({ length: input[0].length + 1 }, (_, i) =>
input.map((l) => l[input[0].length - i]).join(''),
).filter((v) => v.length > 0)
const parse = (input: string) =>
input
.trim()
.split('\n\n')
.map((p) =>
p
.trim()
.split('\n')
.map((l) => l.trim()),
)
export const part1 = (input: string) => {
const patterns = parse(input)
return loopSum((p) => {
const v = vertical(p, null, null)
if (v !== null) return v + 1
const h = vertical(rotate(p), null, null)!
return (h + 1) * 100
}, patterns)
}
export const part2 = (input: string) => {
const patterns = parse(input)
return loopSum((p) => {
const originalV = vertical(p, null, null)
const originalH = vertical(rotate(p), null, null)
for (let y = 0; y < p.length; ++y) {
for (let x = 0; x < p[y].length; ++x) {
const clone = [...p]
clone[y] =
clone[y].slice(0, x) +
(clone[y][x] === '.' ? '#' : '.') +
clone[y].slice(x + 1)
const v = vertical(clone, originalV, null)
if (v !== null && v !== originalV) return v + 1
const h = vertical(rotate(clone), originalH, null)
if (h !== null && h !== originalH) return (h + 1) * 100
}
}
throw new Error('No solution found')
}, patterns)
}