aoc-2020-zig

Advent of Code 2020 Solutions in Zig
git clone https://git.sinitax.com/sinitax/aoc-2020-zig
Log | Files | Refs | README | sfeed.txt

notes (787B)


      1we start with a list of numbers 1 to 1mil
      2
      310 million rounds of moving 3 items from one place to another (depending on input)
      4
      5need to know the product of two labels after cup 1
      6
      7- is the product itself predictable?
      8    - No, its the same as a random product of two numbers between 1 and mil
      9- can we optimize our algo for part 1?
     10    - 1 million numbers (1MiB * 8) is not too bad, but 10 million rounds of ordered removes and inserts is very computationally intense.. could fix that with a linked list
     11- can we reduce the search space?
     12    - for cup 1 we need to know the two cups after it.. those cups were placed there either during a round
     13      where 2 was the current or when 1 was the current and numbers between 1 and the ones next to it now were moved (not really predictable)
     14