commit 7aae97acb787395c98af60adb6f7df2e3824e945 · drubery.com/aoc2025

+38 -2
src/Day9.hs
···

       1
       1
        
       module Day9 where

     

       2
       2
        
       

     

       3
       3
       +
       import Util

     

       4
       4
       +
       

     

       5
       5
       +
       parseLine :: [String] -> Point2

     

       6
       6
       +
       parseLine [x,y] = (read x, read y)

     

       7
       7
       +
       

     

       8
       8
       +
       parse :: String -> [Point2]

     

       9
       9
       +
       parse s = map (parseLine . split ',') $ lines s

     

       10
       10
       +
       

     

       11
       11
       +
       area :: Point2 -> Point2 -> Int

     

       12
       12
       +
       area (x,y) (z,w) = (abs (x - z) + 1) * (abs (y - w) + 1)

     

       13
       13
       +
       

     

       3
       14
        
       part1 :: String -> String

     

       4
       4
       -
       part1 _ = "Day 9 part 1"

     

       15
       15
       +
       part1 input =

     

       16
       16
       +
         let pts = parse input

     

       17
       17
       +
          in show $

     

       18
       18
       +
             maximum $

     

       19
       19
       +
             [ area p q | p <- pts, q <- pts ]

     

       20
       20
       +
       

     

       21
       21
       +
       uniq :: Eq a => [a] -> [a]

     

       22
       22
       +
       uniq [] = []

     

       23
       23
       +
       uniq [a] = [a]

     

       24
       24
       +
       uniq (a:b:cs) = if a == b then uniq (b:cs) else a : (uniq (b:cs))

     

       25
       25
       +
       

     

       26
       26
       +
       edgeIntersect :: (Point2, Point2) -> (Point2, Point2) -> Bool

     

       27
       27
       +
       edgeIntersect (p,q) (r,s) =

     

       28
       28
       +
         max (fst r) (fst s) > min (fst p) (fst q) &&

     

       29
       29
       +
         min (fst r) (fst s) < max (fst p) (fst q) &&

     

       30
       30
       +
         max (snd r) (snd s) > min (snd p) (snd q) &&

     

       31
       31
       +
         min (snd r) (snd s) < max (snd p) (snd q)

     

       32
       32
       +
       

     

       33
       33
       +
       containsRect :: Point2 -> Point2 -> [(Point2,Point2)] -> Bool

     

       34
       34
       +
       containsRect p q edges =

     

       35
       35
       +
         not $ or [edgeIntersect (p,q) e | e <- edges]

     

       5
       36
        
       

     

       6
       37
        
       part2 :: String -> String

     

       7
       7
       -
       part2 _ = "Day 9 part 2"

     

       38
       38
       +
       part2 input =

     

       39
       39
       +
         let pts = parse input

     

       40
       40
       +
             edges = zip pts ((tail pts) ++ [head pts])

     

       41
       41
       +
          in show $

     

       42
       42
       +
             maximum $

     

       43
       43
       +
             [area p q | p <- pts, q <- pts, containsRect p q edges]