lytedev/advent-of-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Day 25 file

Browse source
This commit is contained in:
Daniel Flanagan 2021-12-25 00:19:50 -06:00
parent 6b382e0552
commit 3785e23497
Signed by: lytedev
GPG key ID: 5B2020A0F9921EF4
1 changed files with 4 additions and 27 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

31
2021/nim/day25.nim
View file

@ -1,33 +1,10 @@
import ./common, std/[strutils, sequtils, tables, strformat, algorithm]
proc parseInstructionArg(s: string): int =
let ss = s.split(' ')
if ss.len > 2 and not (ss[2][0] in 'w'..'z'): ss[2].parseInt
else: 0
proc process(input: Lines): Table[int, (int, int)] =
let instructionArgs = input.map(parseInstructionArg)
var cantComputeYet: seq[(int, int)] = @[]
for i in 0..13:
let o = i * 18
if instructionArgs[o+4] == 26:
let (previousI, previousAddend) = cantComputeYet.pop
let diff = previousAddend + instructionArgs[o+5]
if diff < 0:
result[previousI] = (9, -diff + 1)
result[i] = (9 + diff, 1)
else:
result[previousI] = (9 - diff, 1)
result[i] = (9, 1 + diff)
else: cantComputeYet.add (i, instructionArgs[o+15])
proc p1(input: Lines): uint64 =
let processed = input.process
processed.keys.toSeq.sorted.mapIt($processed[it][0]).join().parseBiggestUInt()
0
proc p2(input: Lines): uint64 =
let processed = input.process
processed.keys.toSeq.sorted.mapIt($processed[it][1]).join().parseBiggestUInt()
0
time(&"Day 24 Part 1"): echo 24.loadInput.p1
time(&"Day 24 Part 2"): echo 24.loadInput.p2
time(&"Day 25 Part 1"): echo 25.loadInput.p1
time(&"Day 25 Part 2"): echo 25.loadInput.p2