Skip to content

Commit

Permalink
refactor[day13]: clean up
Browse files Browse the repository at this point in the history
  • Loading branch information
fdlk committed Dec 13, 2022
1 parent 7f5c5c0 commit 1816afb
Show file tree
Hide file tree
Showing 2 changed files with 26 additions and 35 deletions.
51 changes: 21 additions & 30 deletions day13.sc
Original file line number Diff line number Diff line change
@@ -1,39 +1,30 @@
import fastparse._
import common._
import fastparse.{parse, Parsed}
import common.{loadPackets, expr}

val input = loadPackets(List("day13.txt"))

def parseExpression(line: String): Any = {
val Parsed.Success(value, _) = parse(line, common.expr(_))
value
def parseExpression(line: String): Any = parse(line, expr(_)) match {
case Parsed.Success(value, _) => value
}

def isInOrder(pair: (Any, Any)): Option[Boolean] = pair match {
case (a: Int, b: Int) if a < b => Some(true)
case (a: Int, b: Int) if a == b => None
case (a: Int, b: Int) if a > b => Some(false)
case (a: List[Any], b: List[Any]) => (a, b) match {
case (a :: _, b :: _) if isInOrder(a, b).nonEmpty => isInOrder((a, b))
case (_ :: as, _ :: bs) => isInOrder((as, bs))
case (Nil, Nil) => None
case (Nil, _) => Some(true)
case (_, Nil) => Some(false)
}
case (a: Int, b: List[Any]) => isInOrder((List(a), b))
case (a: List[Any], b: Int) => isInOrder((a, List(b)))
val input: List[Any] = loadPackets(List("day13.txt")).filter(_.nonEmpty).map(parseExpression)

def compare(a: Any, b: Any): Int = (a, b) match {
case (a: Int, b: Int) => a.compare(b)
case (a :: _, b :: _) if compare(a, b) != 0 => compare(a, b)
case (_ :: as, _ :: bs) => compare(as, bs)
case (Nil, Nil) => 0
case (Nil, _) => -1
case (_, Nil) => 1
case (a: Int, b: List[Any]) => compare(List(a), b)
case (a: List[Any], b: Int) => compare(a, List(b))
}

val part1 = input.grouped(3)
.map(lines => (parseExpression(lines.head), parseExpression(lines(1))))
.map(pair => isInOrder(pair).get)
val part1 = input.grouped(2)
.map({ case List(a, b) => compare(a, b) })
.zipWithIndex
.filter(_._1)
.filter(_._1 < 0)
.map(_._2 + 1)
.sum

val divider1 = parseExpression("[[2]]")
val divider2 = parseExpression("[[6]]")
val sorted = (divider1 :: divider2 :: input.filter(_.nonEmpty).map(parseExpression))
.sortWith((a, b) => isInOrder(a, b).get)

val part2 = (sorted.indexOf(divider1) + 1) * (sorted.indexOf(divider2) + 1)
val dividers = List("[[2]]","[[6]]").map(parseExpression)
val sorted = (dividers ::: input).sorted(compare)
val part2 = dividers.map(sorted.indexOf).map(_ + 1).product
10 changes: 5 additions & 5 deletions src/main/scala/common/package.scala
Original file line number Diff line number Diff line change
Expand Up @@ -107,17 +107,17 @@ package object common {



def space[_: P] = P(CharsWhileIn(" \r\n", 0))
private def space[_: P] = P(CharsWhileIn(" \r\n", 0))

def digits[_: P] = P(CharsWhileIn("0-9"))
private def digits[_: P] = P(CharsWhileIn("0-9"))

def integral[_: P] = P("0" | CharIn("1-9") ~ digits.?)
private def integral[_: P] = P("0" | CharIn("1-9") ~ digits.?)

def number[_: P] = P(CharIn("+\\-").? ~ integral).!.map(
private def number[_: P] = P(CharIn("+\\-").? ~ integral).!.map(
x => x.toInt
)

def array[_: P] =
private def array[_: P] =
P("[" ~/ expr.rep(sep = ","./) ~ space ~ "]").map(List(_: _*))

def expr[_: P]: P[Any] = P(space ~ (array | number) ~ space)
Expand Down

0 comments on commit 1816afb

Please sign in to comment.