Day 11: Reactor

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ if you prefer sending it through a URL

FAQ

  • mykl@lemmy.world
    link
    fedilink
    arrow-up
    2
    ·
    edit-2
    5 days ago

    Uiua

    If it’s stupid but it works…

    My dirty hack

    I broke the maze into SVR>FFT>DAC>OUT and SVR>DAC>FFT>OUT, realised that the latter was taking a suspiciously long time, so submitted just the answer from the former --> success!

    link (You’ll need to up the execution limit)

    # AOC2025day11 - mazes.
    # Uncomment for Part 1
    D  "aaa: you hhh\nyou: bbb ccc\nbbb: ddd eee\nccc: ddd eee fff\nddd: ggg\neee: out\nfff: out\nggg: out\nhhh: ccc fff iii\niii: out"
    # Uncomment for Part 2
    # D  "svr: aaa bbb\naaa: fft\nfft: ccc\nbbb: tty\ntty: ccc\nccc: ddd eee\nddd: hub\nhub: fff\neee: dac\ndac: fff\nfff: ggg hhh\nggg: out\nhhh: out"
    # D       &fras "randomAOC/AOC2025day11.txt"
    Tabs    (⊙□°⊂⊜∘¬⊸∊": ")⊸≠@\nD
    Nexts   (°□⊡˜⨂⊙Tabs|[])
    Part₁   ⊙◌⧻path(˙≠°⊏Nexts|≍"out")"you"
    
    Part₂  (
      ⊙◌⧻path(˙≠°⊏Nexts|≍"fft")"svr"
      ⊙◌⧻path(˙≠°⊏Nexts|≍"dac")"fft"
      ⊙◌⧻path(˙≠°⊏Nexts|≍"out")"dac"
      ××
    )
    # Only one will be right for the test data, depending on dataset.
    Part₁ Part₂
    
    • CameronDev@programming.devOPM
      link
      fedilink
      arrow-up
      2
      ·
      5 days ago

      I also broke up the pathing, mine has zero paths from DAC to FFT. If I join DAC directly FFT, i get a stackoverflow, so maybe its intentional.

      • EnEnCode@programming.dev
        link
        fedilink
        English
        arrow-up
        2
        ·
        5 days ago

        If you can explain why it works, not calculating half the paths isn’t a hack—it’s an optimization. ;)

        • CameronDev@programming.devOPM
          link
          fedilink
          arrow-up
          1
          ·
          4 days ago

          I think the hack was just skipping the entire second set of paths, but yeah, splitting was an nice optimisation. Might not scale as well if that path had to hit multiple intermediate nodes though.

      • mykl@lemmy.world
        link
        fedilink
        arrow-up
        2
        ·
        5 days ago

        Yes, it felt a little more like I was solving the puzzle-setter rather than the puzzle today.