-
Notifications
You must be signed in to change notification settings - Fork 0
/
day19.ts
221 lines (176 loc) · 5.12 KB
/
day19.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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
import _ from "lodash";
import fs from "fs";
const lines: string[] = _.reject(
fs.readFileSync("inputs/day19.txt", "utf-8").split("\n"),
_.isEmpty
);
interface Rule {
readonly callback: (input: Part) => string | undefined;
readonly ruleString: string;
}
interface Workflow {
readonly name: string;
readonly rules: Rule[];
}
interface Part {
readonly x: number;
readonly m: number;
readonly a: number;
readonly s: number;
}
// For maximum flexibility, we'll build a rule lambda
const buildRule = (ruleString: string): Rule => {
const colonIndex = ruleString.indexOf(":");
if (colonIndex === -1) {
return { callback: (_) => ruleString, ruleString };
} else {
const [condition, output] = ruleString.split(":");
const lhs = condition.charAt(0);
const operator = condition.charAt(1);
const rhs = condition.slice(2);
return {
callback: (input) => {
const substitution = input[lhs as keyof Part];
if (eval(`${substitution} ${operator} ${rhs}`)) {
return output;
}
return undefined;
},
ruleString,
};
}
};
const workflows: Map<string, Workflow> = new Map();
const parts: Part[] = [];
// Example: px{a<2006:qkq,m>2090:A,rfg}
const addWorkflow = (line: string): void => {
const openingBracket = line.indexOf("{");
const name = line.slice(0, openingBracket);
const rules = line
.slice(openingBracket + 1, line.length - 1)
.split(",")
.map(buildRule);
workflows.set(name, { name, rules });
};
// Example: {x=787,m=2655,a=1222,s=2876}
const addPart = (line: string): void => {
const [x, m, a, s] = line
.slice(1, line.length - 1)
.split(",")
.map((part) => parseInt(part.split("=")[1]));
parts.push({ x, m, a, s });
};
// Is the original part accepted by the workflow or its derivatives?
const isAccepted = (part: Part, currentRuleName: string): boolean => {
const workflow: Workflow = workflows.get(currentRuleName)!;
// Find the first applicable rule and call it inline
const result: string = _.find(
workflow.rules,
({ callback }) => callback(part) !== undefined
)!.callback(part)!;
if (result === "A") {
return true;
}
if (result === "R") {
return false;
}
return isAccepted(part, result);
};
const sumPart = (part: Part): number => _.sum(Object.values(part));
lines.forEach((line) => {
if (line.startsWith("{")) {
addPart(line);
} else {
addWorkflow(line);
}
});
// Part 1
console.log(
_.sum(parts.map((part) => (isAccepted(part, "in") ? sumPart(part) : 0)))
);
interface PartRanges {
readonly x: [number, number];
readonly m: [number, number];
readonly a: [number, number];
readonly s: [number, number];
}
const rangesMultiply = (partRanges: PartRanges): number => {
const lengths = Object.values(partRanges).map(([min, max]) =>
Math.max(0, max - min + 1)
);
return lengths.reduce((a, b) => a * b);
};
// We can sum the range counts that are valid whenever we hit a base case!
const countAccepted = (
partRanges: PartRanges,
currentRuleName: string
): number => {
if (currentRuleName === "A") {
return rangesMultiply(partRanges);
}
if (currentRuleName === "R") {
return 0;
}
const workflow: Workflow = workflows.get(currentRuleName)!;
let possibilities = 0;
for (let ruleIndex = 0; ruleIndex < workflow.rules.length; ruleIndex++) {
const ruleString = workflow.rules[ruleIndex].ruleString;
if (ruleString === "A") {
possibilities += rangesMultiply(partRanges);
break;
}
if (ruleString === "R") {
break;
}
const colonIndex = ruleString.indexOf(":");
if (colonIndex === -1) {
possibilities += countAccepted(partRanges, ruleString);
break;
}
// We have to constrict the ranges for the next rule
const [condition, output] = ruleString.split(":");
const lhs = condition.charAt(0);
const operator = condition.charAt(1);
const rhs = parseInt(condition.slice(2));
if (operator === ">") {
// Activate this rule with a new range we split off
const newPartRanges = _.cloneDeep(partRanges);
newPartRanges[lhs as keyof PartRanges][0] = Math.max(
newPartRanges[lhs as keyof PartRanges][0],
rhs + 1
);
possibilities += countAccepted(newPartRanges, output);
// Modify this range to head past this rule
partRanges[lhs as keyof PartRanges][1] = Math.min(
partRanges[lhs as keyof PartRanges][1],
rhs
);
} else if (operator === "<") {
// Activate this rule with a new range we split off
const newPartRanges = _.cloneDeep(partRanges);
newPartRanges[lhs as keyof PartRanges][1] = Math.min(
newPartRanges[lhs as keyof PartRanges][1],
rhs - 1
);
possibilities += countAccepted(newPartRanges, output);
// Modify this range to head past this rule
partRanges[lhs as keyof PartRanges][0] = Math.max(
partRanges[lhs as keyof PartRanges][0],
rhs
);
}
}
return possibilities;
};
// Part 2
console.log(
countAccepted(
{
x: [1, 4000],
m: [1, 4000],
a: [1, 4000],
s: [1, 4000],
},
"in"
)
);