summaryrefslogtreecommitdiff
path: root/12.c
diff options
context:
space:
mode:
authorAdam Spragg <adam@spra.gg>2022-12-31 15:23:31 +0000
committerAdam Spragg <adam@spra.gg>2022-12-31 15:23:31 +0000
commitb043397f2718dec1879e4b438518378ad70dbace (patch)
tree1531f21a35864bebbb85e7bb1cd5fcb418426d20 /12.c
parenta2d928fe2647e4b80d87731417407f1533b8e4a4 (diff)
Puzzle 19: Never build more robots than needed
Because we can only build one robot at a time, if the most expensive robot in terms of ore takes 4 ore to build, we'll never need more than 4 ore robots. Because they can always collect enough ore to build one robot of any type per turn. Drops time by 90% on 20-round test data (5.4s -> 0.5s)
Diffstat (limited to '12.c')
0 files changed, 0 insertions, 0 deletions