Day 3

.idea/compiler.xml

@@ -7,7 +7,11 @@
         <sourceTestOutputDir name="target/generated-test-sources/test-annotations" />
         <outputRelativeToContentRoot value="true" />
         <module name="advent-of-code2019" />
+        <module name="advent-of-code-2019" />
       </profile>
     </annotationProcessing>
+    <bytecodeTargetLevel>
+      <module name="advent-of-code-2019" target="1.5" />
+    </bytecodeTargetLevel>
   </component>
 </project>

.idea/encodings.xml

@@ -2,5 +2,7 @@
 <project version="4">
   <component name="Encoding">
     <file url="file://$PROJECT_DIR$" charset="UTF-8" />
+    <file url="file://$PROJECT_DIR$/src/main/kotlin" charset="UTF-8" />
+    <file url="file://$PROJECT_DIR$/src/main/resources" charset="UTF-8" />
   </component>
 </project>

src/main/kotlin/com/basdado/adventofcode/day3/Day3.kt

@@ -0,0 +1,115 @@
+package com.basdado.adventofcode.day3
+
+import com.basdado.adventofcode.lines
+import java.lang.StringBuilder
+import kotlin.math.abs
+
+const val DAY3_PATH = "/day/3/ex1.txt"
+
+fun main() {
+    Day3.puzzle1()
+    Day3.puzzle2()
+}
+
+object Day3 {
+
+    fun puzzle1() {
+
+        val grid = Grid()
+
+        val wires = lines(DAY3_PATH)
+            .filter { it.isNotBlank() }
+            .map { Wire(it.split(",").filter { op -> op.isNotBlank() }) }
+            .forEach{ process(grid, it) }
+
+//        println(grid)
+        val intersections = grid.getIntersections().map { it.key }.sortedBy(::manhattanDistance)
+        println(intersections)
+        println("Closest intersection at ${intersections.minBy(::manhattanDistance)}, distance: ${intersections.map(::manhattanDistance).min()}")
+
+
+    }
+
+    fun puzzle2() {
+
+        val grid = Grid()
+
+        val wires = lines(DAY3_PATH)
+            .filter { it.isNotBlank() }
+            .map { Wire(it.split(",").filter { op -> op.isNotBlank() }) }
+            .forEach{ process(grid, it) }
+
+        val intersections = grid.getIntersections().entries.sortedBy { combinedWireLength(it.value) }
+        println(intersections)
+        println("Closest intersection at ${intersections.first()}, distance: ${combinedWireLength(intersections.first().value)}")
+
+    }
+
+    private fun manhattanDistance(p: Point) = abs(p.x) + abs(p.y)
+    private fun combinedWireLength(parts: List<WirePart>): Int {
+        val wires = parts.map { it.wire }.distinct()
+        return wires.map { wire -> parts.filter { it.wire == wire }.map { it.length }.min()!! }.sum()
+    }
+
+    private fun process(grid: Grid, wire: Wire) {
+
+//        println(wire)
+
+        var cur = Point(0, 0)
+        var len = 0;
+
+        for (op in wire.operations) {
+            when(op[0]) {
+                'L' -> repeat(op.substring(1).toInt()) { cur = Point(cur.x-1, cur.y); grid.add(cur, WirePart(wire, ++len)) }
+                'R' -> repeat(op.substring(1).toInt()) { cur = Point(cur.x+1, cur.y); grid.add(cur, WirePart(wire, ++len)) }
+                'U' -> repeat(op.substring(1).toInt()) { cur = Point(cur.x, cur.y+1); grid.add(cur, WirePart(wire, ++len)) }
+                'D' -> repeat(op.substring(1).toInt()) { cur = Point(cur.x, cur.y-1); grid.add(cur, WirePart(wire, ++len)) }
+            }
+//            println(grid)
+        }
+    }
+
+    data class Point(val x: Int, val y: Int)
+    data class Wire(val operations: List<String>)
+    data class WirePart(val wire: Wire, val length: Int)
+
+    class Grid(private val data: MutableMap<Point, MutableList<WirePart>> = mutableMapOf()) {
+
+        fun add(point: Point, wire: WirePart) {
+            if (data[point] != null) {
+                data[point]!!.add(wire)
+            } else {
+                data[point] = mutableListOf(wire)
+            }
+        }
+
+        fun getIntersections(): Map<Point, List<WirePart>> {
+            return data.filter { it.value.distinctBy{ it.wire }.size > 1 }
+        }
+
+        override fun toString(): String {
+            val minX = data.minBy { it.key.x }?.key?.x ?: 0
+            val maxX = data.maxBy { it.key.x }?.key?.x ?: 0
+            val minY = data.minBy { it.key.y }?.key?.y ?: 0
+            val maxY = data.maxBy { it.key.y }?.key?.y ?: 0
+
+            val res = StringBuilder()
+
+            for (y in maxY downTo minY) {
+                for (x in minX..maxX) {
+                    res.append(
+                        if (x == 0 && y == 0) 'o' else
+                        if (data[Point(x, y)] != null)
+                            if (data[Point(x, y)]!!.size > 1)
+                                'X'
+                            else '-'
+                        else '.'
+                    )
+
+                }
+                res.append("\r\n")
+            }
+            return res.toString()
+        }
+    }
+}

src/main/resources/day/3/ex1.txt

@@ -0,0 +1,2 @@
+R8,U5,L5,D3
+U7,R6,D4,L4

src/main/resources/day/3/ex2.txt

@@ -0,0 +1,2 @@
+R75,D30,R83,U83,L12,D49,R71,U7,L72
+U62,R66,U55,R34,D71,R55,D58,R83

src/main/resources/day/3/ex3.txt

@@ -0,0 +1,2 @@
+R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51
+U98,R91,D20,R16,D67,R40,U7,R15,U6,R7

src/main/resources/day/3/input.txt

@@ -0,0 +1,2 @@
+R1000,U371,R195,U136,R804,U805,L450,U211,R768,U768,L548,U354,L736,U431,L152,U658,L670,D262,L277,U136,L290,U939,R501,U550,L931,D839,R335,D492,L25,U80,R878,U355,R653,U186,R423,D485,L793,D259,L739,U679,R508,D269,R432,D761,R97,D461,L675,U958,L58,U348,L719,D271,R144,U849,R384,U72,L84,U493,R947,U30,L356,D442,R327,U646,R825,U718,L329,D173,L949,D345,L971,D830,L93,U506,R245,D376,R322,D105,L604,D60,R298,D959,L165,D423,R180,D527,R956,D944,R785,U641,L794,D182,R975,D719,L166,U974,L224,U243,L666,U706,R796,D600,L856,D913,L988,D993,L259,U351,R487,D424,L335,U910,L437,D180,R621,D3,R878,D188,R254,D393,L727,U829,R352,U958,L327,D158,L854,D17,R143,D454,R889,D265,L345,U784,R35,D129,R77,U117,R951,D980,L866,U646,R242,D603,L562,U727,L496,U328,L380,D504,R644,U803,L530,D546,R328,D373,L489,U454,R74,D908,R366,U94,R604,D482,L573,D27,R943,U497,L782,D267,L391,U49,R528,D58,R155,D529,R227,D998,R558,D891,R224,U843,R512,U34,R92,U404,R752,U946,L338,D880,L513,D28,L856,D444,L187,U532,L187,U669,L306,U259,R287,D442,R478,U576,R702,U336,L305,U701,L754,D277,R760,D863,L717,U196,L221,U101,L334,D156,L961,D810,L67,D716,L457,D44,L505,D724,R716,D660,L36,D338,R54,U424,R730,U18,L65,D133,R149,U374,R356,D989,R519,U593,L444,D270,R328,U167,L748,D797,L434,U751,R444,D71,R158,D530,L630,U147,R909,D994,L957,U521,L644,D579,R673,U191,R935,U237,R600,D321,L671,U961,L884,U378,R534,D46,R275,U845,R571,U245,L507,U273,R995,U408,L14,D799,L955,D534,R579,D94,R705,D391,R469,D381,R620,U162,R907,D826,R824,U167,L734,U922,L484
+L1007,D620,R853,U77,L13,U473,L253,D410,R897,U464,L862,U281,L650,D470,R87,D204,L896,U670,L864,D950,L75,D320,R901,D785,L653,D225,L857,U616,L143,U940,L664,U131,L547,D745,R636,U569,L50,U454,R288,D254,L36,U377,L609,U929,L714,U85,L939,U923,L566,D280,R243,U948,R447,D7,R908,D151,R824,D432,R34,D81,L458,U745,L420,D982,L625,U910,L729,D274,R910,U322,L984,D88,L700,D349,L932,U510,R625,U88,L252,U785,L378,D101,R299,U66,L476,U696,R236,D46,R590,U157,R461,U305,L269,D487,L676,U467,R319,D524,R75,U65,L478,U861,L238,D716,R888,D12,L184,D578,R266,D226,L656,D172,L752,U124,L831,U810,L663,U538,R417,D770,L359,U1,R12,U791,L332,U272,R574,D942,L857,U447,R310,U342,L713,D258,R590,D585,R129,D115,R832,D967,R981,D159,R864,U423,R268,U519,L52,D493,R445,D657,R885,U166,R155,D264,R51,D632,R525,D875,R617,U898,L556,D386,L143,U278,L767,D389,R821,U869,R286,D90,R289,U54,R15,D764,R46,D674,R983,U49,R959,U779,R958,D247,R483,U156,L18,U12,L178,U540,L499,U487,L544,D336,R814,U267,R145,D135,L920,D902,L933,D507,L997,U361,L577,U425,L773,D782,R117,U851,R998,U503,R902,U781,L161,U98,L653,U633,L91,U629,L138,D19,R147,D756,R364,D529,L764,U913,L118,U856,R774,D621,R151,U154,R737,D960,R86,U458,R991,D481,R560,D858,R223,D6,R931,D301,R552,D797,R284,U368,L967,D686,R940,U410,R137,D156,L6,U643,L445,D999,R888,D277,L852,U210,L777,D36,R103,D652,R120,D67,L642,D527,R913,D858,R69,D433,R864,U75,L531,U456,L664,D452,R801,U851,L824,D278,L526,U133,R200,U768,R15,U393,R982,U287,L38,D114,R86,U299,L819,D891,R379,D601,L244