c3be4f6f59
Part 2 is pretty slow, since we just reuse our fast solution for part 1. This means we have to check 4000000 which could be reduced a bit by using a loop. It is tolerably slow, so whatever. (Overall this problem would have been more fun if the space to check was smaller.) Change-Id: I1203330fe0364894cfe0318376e583868937b5bd Reviewed-on: https://cl.tvl.fyi/c/depot/+/7603 Reviewed-by: sterni <sternenseemann@systemli.org> Autosubmit: sterni <sternenseemann@systemli.org> Tested-by: BuildkiteCI
18 lines
805 B
BQN
18 lines
805 B
BQN
lib ← •Import "../../lib.bqn"
|
||
|
||
F ← ¬∘('-'⊸=∨lib.IsAsciiNum)
|
||
i ← ⌽˘˘∘‿2‿2⥊lib.ReadDec¨>(0⊸<⟜≠¨/⊢)∘((F ¯1˙⍟⊣¨(+`F))⊔⊢)¨ •FLines "input"
|
||
|
||
ssp ← 4000000
|
||
|
||
sds ← (⊏˘∾˘(+´˘(|(-˝))˘)) i
|
||
|
||
# _fix is needed to deal with e.g. ⟨0‿15, 5‿8, 12‿23⟩
|
||
MergeRanges ← ((⊑∾⊑∘⌽)∘∧∘∾)¨∘(+`∘((<∞‿∞)⊸»{<´1‿2⊏𝕨∾𝕩}¨⊢)⊔⊢) lib._fix
|
||
|
||
Range ← {cky 𝕊 y‿x‿d: x+¯1‿1×d-|cky-y}
|
||
RangesY ← {<˘∧𝕩(⊣Range˘({cky 𝕊 y‿·‿d: d≥|y-cky}˘/⊢))sds}
|
||
OutRangeY ← {(1<≠)◶⟨0˙,𝕩⊸+∘(ssp⊸×⟜(+⟜1))∘(1⊸⊑)∘∾⟩ MergeRanges ssp⌊0⌈RangesY 𝕩}
|
||
|
||
•Out "day15.1: "∾•Fmt +´-˜´¨MergeRanges RangesY 2÷˜ssp
|
||
•Out "day15.2: "∾•Fmt +´OutRangeY¨↕ssp
|