☃️ - 2023 DAY 11 SOLUTIONS - ☃️ - eviltoast

Day 11: Cosmic Expansion

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)
  • Code block support is not fully rolled out yet but likely will be in the middle of the event. Try to share solutions as both code blocks and using something such as https://topaz.github.io/paste/ , pastebin, or github (code blocks to future proof it for when 0.19 comes out and since code blocks currently function in some apps and some instances as well if they are running a 0.19 beta)

FAQ


🔒 Thread is locked until there’s at least 100 2 star entries on the global leaderboard

🔓 Unlocked after 9 mins

  • cvttsd2si@programming.dev
    link
    fedilink
    arrow-up
    1
    ·
    11 months ago

    Scala3

    def compute(a: List[String], growth: Long): Long =
        val gaps = Seq(a.map(_.toList), a.transpose).map(_.zipWithIndex.filter((d, i) => d.forall(_ == '.')).map(_._2).toSet)
        val stars = for y <- a.indices; x <- a(y).indices if a(y)(x) == '#' yield List(x, y)
    
        def dist(gaps: Set[Int], a: Int, b: Int): Long = 
            val i = math.min(a, b) until math.max(a, b)
            i.size.toLong + (growth - 1)*i.toSet.intersect(gaps).size.toLong
    
        (for Seq(p, q) <- stars.combinations(2); m <- gaps.lazyZip(p).lazyZip(q).map(dist) yield m).sum
    
    def task1(a: List[String]): Long = compute(a, 2)
    def task2(a: List[String]): Long = compute(a, 1_000_000)