From 2dd1bf17d52dec74c9b3ebb6ae1915e75ae9ce71 Mon Sep 17 00:00:00 2001
From: Eric Mertens <emertens@gmail.com>
Date: Wed, 18 Dec 2024 08:09:37 -0800
Subject: [PATCH] wrong length

---
 solutions/src/2024/18.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/solutions/src/2024/18.hs b/solutions/src/2024/18.hs
index 18e6e43..410c0cd 100644
--- a/solutions/src/2024/18.hs
+++ b/solutions/src/2024/18.hs
@@ -31,7 +31,7 @@ main =
     print cost
     let input'       = reverse input
         isBlocking i = isNothing (search (drop i input'))
-        (x,y)        = input' !! binSearchLargest isBlocking 0 1024
+        (x,y)        = input' !! binSearchLargest isBlocking 0 (length input' - 1024)
     putStrLn (show x ++ "," ++ show y)
 
 -- | Find the minimum cost to go from one side of the maze to the other, if there is one.