chore: add solutions for AoC day seven

Author: Pawel Knap

Day05.jl

@@ -11,18 +11,17 @@ data = map(
 
 # Part 1
 allpoints =
-    (line) -> (
-        mincoord = min.(line[1], line[2]);
-        maxcoord = max.(line[1], line[2]);
-        filter(
-            p -> (norm(line[1] .- p) + norm(line[2] .- p) ≈ norm(line[1] .- line[2])),
-            vec(
-                collect(
-                    Iterators.product(mincoord[1]:maxcoord[1], mincoord[2]:maxcoord[2]),
+    (line) -> (filter(
+        p -> (norm(line[1] .- p) + norm(line[2] .- p) ≈ norm(line[1] .- line[2])),
+        vec(
+            collect(
+                Iterators.product(
+                    range(extrema(first.(line))...),
+                    range(extrema(last.(line))...),
                 ),
             ),
-        )
-    );
+        ),
+    ));
 
 getans = (data) -> count(>(1), values(countmap(Iterators.flatten(map(allpoints, data)))));
 

Day07.jl

@@ -0,0 +1,17 @@
+# Input data
+data = map(x -> parse(Int64, x), split(readline("Day07.input"), ","));
+
+# Part 1
+mindistance =
+    (F, data) ->
+        reduce((acc, v) -> min(acc, v), map(x -> F(x, data), range(extrema(data)...)))
+
+ans = mindistance((x, data) -> sum(map(v -> abs(v - x), data)), data);
+println("Part 1: $ans")
+
+# Part 2
+ans = mindistance(
+    (x, data) -> sum(map(v -> (n = abs(v - x); (n * (n + 1)) >> 1), data)),
+    data,
+);
+println("Part 2: $ans")