-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathAdventOfCode2018Day19.java
536 lines (488 loc) · 11.7 KB
/
AdventOfCode2018Day19.java
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
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
import java.util.*;
import java.util.HashMap;
import java.util.concurrent.Callable;
public class AdventOfCode2018Day19 {
private static int a = 1, b = 0, c = 0, d = 0, e = 0, f = 0;
private static HashMap<Integer, Callable<String>> hm = new HashMap<Integer, Callable<String>>() {
{
put(0, () -> {
f = f + 16;
return "";
});
put(1, () -> {
c = 1;
return "";
});
put(2, () -> {
b = 1;
return "";
});
put(3, () -> {
d = c * b;
return "";
});
put(4, () -> {
d = (d == e) ? 1 : 0;
return "";
});
put(5, () -> {
f = d + f;
return "";
});
put(6, () -> {
f = f + 1;
return "";
});
put(7, () -> {
a = c + a;
return "";
});
put(8, () -> {
b = b + 1;
return "";
});
put(9, () -> {
d = (b > e) ? 1 : 0;
return "";
});
put(10, () -> {
f = f + d;
return "";
});
put(11, () -> {
f = 2;
return "";
});
put(12, () -> {
c = c + 1;
return "";
});
put(13, () -> {
d = (c > e) ? 1 : 0;
return "";
});
put(14, () -> {
f = d + f;
return "";
});
put(15, () -> {
f = 1;
return "";
});
put(16, () -> {
f = f * f;
return "";
});
put(17, () -> {
e = e + 2;
return "";
});
put(18, () -> {
e = e * e;
return "";
});
put(19, () -> {
e = f * e;
return "";
});
put(20, () -> {
e = e * 11;
return "";
});
put(21, () -> {
d = d + 2;
return "";
});
put(22, () -> {
d = d * f;
return "";
});
put(23, () -> {
d = d + 13;
return "";
});
put(24, () -> {
e = e + d;
return "";
});
put(25, () -> {
f = f + a;
return "";
});
put(26, () -> {
f = 0;
return "";
});
put(27, () -> {
d = f;
return "";
});
put(28, () -> {
d = d * f;
return "";
});
put(29, () -> {
d = f + d;
return "";
});
put(30, () -> {
d = f * d;
return "";
});
put(31, () -> {
d = d * 14;
return "";
});
put(32, () -> {
d = d * f;
return "";
});
put(33, () -> {
e = e + d;
return "";
});
put(34, () -> {
a = 0;
return "";
});
put(35, () -> {
f = 0;
return "";
});
}
};
private static String[] r = {"a", "b", "c", "d", "e", "f"}; // registers 0,1,2,3,4,5
private static void initOps(HashMap<String, Operation> ops) {
ops.put("addr", new Addr());
ops.put("addi", new Addi());
ops.put("mulr", new Mulr());
ops.put("muli", new Muli());
ops.put("banr", new Banr());
ops.put("bani", new Bani());
ops.put("borr", new Borr());
ops.put("bori", new Bori());
ops.put("setr", new Setr());
ops.put("seti", new Seti());
ops.put("gtir", new Gtir());
ops.put("gtri", new Gtri());
ops.put("gtrr", new Gtrr());
ops.put("eqir", new Eqir());
ops.put("eqri", new Eqri());
ops.put("eqrr", new Eqrr());
}
private static void doOp(HashMap<String, Operation> ops, ArrayList<Long> regs, String instruction) {
String[] splitted = instruction.split(" ");
String name = splitted[0];
int A = Integer.parseInt(splitted[1]);
int B = Integer.parseInt(splitted[2]);
int C = Integer.parseInt(splitted[3]);
ops.get(name).process(A, B, C, regs);
}
private static void recompile(String instruction) {
String[] splitted = instruction.split(" ");
String name = splitted[0];
int A = Integer.parseInt(splitted[1]);
int B = Integer.parseInt(splitted[2]);
int C = Integer.parseInt(splitted[3]);
switch (name) {
case "addr":
System.out.println(r[C] + " = " + r[A] + " + " + r[B]);
break;
case "addi":
System.out.println(r[C] + " = " + r[A] + " + " + B);
break;
case "mulr":
System.out.println(r[C] + " = " + r[A] + " * " + r[B]);
break;
case "muli":
System.out.println(r[C] + " = " + r[A] + " * " + B);
break;
case "banr":
System.out.println(r[C] + " = " + r[A] + " & " + r[B]);
break;
case "bani":
System.out.println(r[C] + " = " + r[A] + " & " + B);
break;
case "borr":
System.out.println(r[C] + " = " + r[A] + " | " + r[B]);
break;
case "bori":
System.out.println(r[C] + " = " + r[A] + " | " + B);
break;
case "setr":
System.out.println(r[C] + " = " + r[A]);
break;
case "seti":
System.out.println(r[C] + " = " + A);
break;
case "gtir":
System.out.println(r[C] + " = (" + A + " > " + r[B] + ") ? 1 : 0");
break;
case "gtri":
System.out.println(r[C] + " = (" + r[A] + " > " + B + ") ? 1 : 0");
break;
case "gtrr":
System.out.println(r[C] + " = (" + r[A] + " > " + r[B] + ") ? 1 : 0");
break;
case "eqir":
System.out.println(r[C] + " = (" + A + " == " + r[B] + ") ? 1 : 0");
break;
case "eqri":
System.out.println(r[C] + " = (" + r[A] + " == " + B + ") ? 1 : 0");
break;
case "eqrr":
System.out.println(r[C] + " = (" + r[A] + " == " + r[B] + ") ? 1 : 0");
break;
}
}
public static void main(String args[]) throws Exception {
// operation_name, operation
HashMap<String, Operation> ops = new HashMap<>();
ArrayList<Long> regs = new ArrayList<>();
for (int i = 0; i < 6; i++) regs.add(new Long(0));
initOps(ops);
Scanner s = new Scanner(System.in);
Long ip = Long.parseLong(s.nextLine().split(" ")[1]);
int bound = ip.intValue();
ArrayList<String> instructions = new ArrayList<>();
while (true) {
String line = s.nextLine();
if (line.equals("")) break;
instructions.add(line);
}
s.close();
// recompile the instructions
for (String l : instructions) {
recompile(l);
}
// first part, just a normal run without any hacks
ip = regs.get(bound);
while (ip >= 0 && ip < instructions.size()) {
regs.set(bound, ip);
doOp(ops, regs, instructions.get(ip.intValue()));
ip = regs.get(bound) + 1;
}
System.out.println("Answer to the first part: " + regs.get(0));
// second part, a few hacks:
// could have made it more universal without transforming Elf code into
// java code but realized it too far into it so...
int nip = 0;
long count = 0;
HashMap<Integer, Integer> loop = new HashMap<Integer, Integer>();
boolean loopFound = false;
while (nip >= 0 && nip < instructions.size()) {
f = nip;
hm.get(nip).call();
nip = f + 1;
if (loop.containsKey(nip)) loopFound = true;
else loop.put(nip, 1);
// fast-forward if there is a loop
if (nip == 3 && loopFound && b < e / c) {
if (e % c == 0) b = e / c;
else b = e;
loopFound = false;
loop = new HashMap<Integer, Integer>();
}
else if (nip == 3 && loopFound) {
b = e;
loopFound = false;
loop = new HashMap<Integer, Integer>();
}
//if (count++ % 1000000 == 0) System.out.println(nip + ": " + a + ", " + b + ", " + c + ", " + d + ", " + e + ", " + f);
}
System.out.println("Answer to the second part: " + a);
}
}
interface Operation {
public void process(int A, int B, int C, ArrayList<Long> registers);
public String getName();
}
class Addr implements Operation {
String name = "addr";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A) + registers.get(B));
}
public String getName() {
return name;
}
}
class Addi implements Operation {
String name = "addi";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A) + B);
}
public String getName() {
return name;
}
}
class Mulr implements Operation {
String name = "mulr";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A) * registers.get(B));
}
public String getName() {
return name;
}
}
class Muli implements Operation {
String name = "muli";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A) * B);
}
public String getName() {
return name;
}
}
class Banr implements Operation {
String name = "banr";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A) & registers.get(B));
}
public String getName() {
return name;
}
}
class Bani implements Operation {
String name = "bani";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A) & B);
}
public String getName() {
return name;
}
}
class Borr implements Operation {
String name = "borr";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A) | registers.get(B));
}
public String getName() {
return name;
}
}
class Bori implements Operation {
String name = "bori";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A) | B);
}
public String getName() {
return name;
}
}
class Setr implements Operation {
String name = "setr";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, registers.get(A));
}
public String getName() {
return name;
}
}
class Seti implements Operation {
String name = "seti";
public void process(int A, int B, int C, ArrayList<Long> registers) {
registers.set(C, new Long(A));
}
public String getName() {
return name;
}
}
class Gtir implements Operation {
String name = "gtir";
public void process(int A, int B, int C, ArrayList<Long> registers) {
if (A > registers.get(B).intValue()) registers.set(C, new Long(1));
else registers.set(C, new Long(0));
}
public String getName() {
return name;
}
}
class Gtri implements Operation {
String name = "gtri";
public void process(int A, int B, int C, ArrayList<Long> registers) {
if (registers.get(A).intValue() > B) registers.set(C, new Long(1));
else registers.set(C, new Long(0));
}
public String getName() {
return name;
}
}
class Gtrr implements Operation {
String name = "gtrr";
public void process(int A, int B, int C, ArrayList<Long> registers) {
if (registers.get(A).intValue() > registers.get(B).intValue()) registers.set(C, new Long(1));
else registers.set(C, new Long(0));
}
public String getName() {
return name;
}
}
class Eqir implements Operation {
String name = "eqir";
public void process(int A, int B, int C, ArrayList<Long> registers) {
if (A == registers.get(B).intValue()) registers.set(C, new Long(1));
else registers.set(C, new Long(0));
}
public String getName() {
return name;
}
}
class Eqri implements Operation {
String name = "eqri";
public void process(int A, int B, int C, ArrayList<Long> registers) {
if (registers.get(A).intValue() == B) registers.set(C, new Long(1));
else registers.set(C, new Long(0));
}
public String getName() {
return name;
}
}
class Eqrr implements Operation {
String name = "eqrr";
public void process(int A, int B, int C, ArrayList<Long> registers) {
if (registers.get(A).intValue() == registers.get(B).intValue()) registers.set(C, new Long(1));
else registers.set(C, new Long(0));
}
public String getName() {
return name;
}
}
/*
#ip 5
addi 5 16 5
seti 1 1 2
seti 1 8 1
mulr 2 1 3
eqrr 3 4 3
addr 3 5 5
addi 5 1 5
addr 2 0 0
addi 1 1 1
gtrr 1 4 3
addr 5 3 5
seti 2 6 5
addi 2 1 2
gtrr 2 4 3
addr 3 5 5
seti 1 2 5
mulr 5 5 5
addi 4 2 4
mulr 4 4 4
mulr 5 4 4
muli 4 11 4
addi 3 2 3
mulr 3 5 3
addi 3 13 3
addr 4 3 4
addr 5 0 5
seti 0 8 5
setr 5 5 3
mulr 3 5 3
addr 5 3 3
mulr 5 3 3
muli 3 14 3
mulr 3 5 3
addr 4 3 4
seti 0 9 0
seti 0 9 5
*/