-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path14.js
71 lines (56 loc) · 1.5 KB
/
14.js
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
const R = require('ramda')
const { frequency } = require('../utils')
const parseInput = (input) => {
const [template, rulesRaw] = input.trim().split('\n\n')
const rules = R.pipe(
R.split('\n'),
R.map((rules) => {
const [pair, letter] = R.split(' -> ', rules)
return [
pair,
{
letter,
leftPair: pair[0] + letter,
rightPair: letter + pair[1],
},
]
}),
R.fromPairs,
)(rulesRaw)
return { template, rules }
}
const solve = (template, rules, steps) => {
const state = R.pipe(
R.aperture(2),
R.map(([a, b]) => [a + b, 1]),
R.fromPairs,
)(template)
const letters = frequency(template)
for (let i = 0; i < steps; i++) {
for (const [pair, count] of Object.entries(state)) {
if (rules[pair] !== undefined) {
const { leftPair, rightPair, letter } = rules[pair]
state[pair] -= count
state[leftPair] = (state[leftPair] ?? 0) + count
state[rightPair] = (state[rightPair] ?? 0) + count
letters[letter] = (letters[letter] ?? 0) + count
}
}
}
const entries = R.values(letters)
const max = R.reduce(R.max, -Infinity, entries)
const min = R.reduce(R.min, +Infinity, entries)
return max - min
}
const part1 = (input) => {
let { template, rules } = parseInput(input)
return solve(template, rules, 10)
}
const part2 = (input) => {
let { template, rules } = parseInput(input)
return solve(template, rules, 40)
}
module.exports = {
part1,
part2,
}