Thanks to visit codestin.com
Credit goes to github.com

Skip to content

Commit 8ac053b

Browse files
lacolaco
committed
day03 part 1-2
1 parent de75390 commit 8ac053b

File tree

2 files changed

+144
-0
lines changed

2 files changed

+144
-0
lines changed

‎resources/day03_input.txt‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,2 @@
1+
R997,D99,R514,D639,L438,D381,L251,U78,L442,D860,R271,U440,L428,U482,R526,U495,R361,D103,R610,D64,L978,U587,L426,D614,R497,D116,R252,U235,R275,D882,L480,D859,L598,D751,R588,D281,R118,U173,L619,D747,R994,U720,L182,U952,L49,D969,R34,D190,L974,U153,L821,U593,L571,U111,L134,U111,R128,D924,R189,U811,R100,D482,L708,D717,L844,U695,R277,D81,L107,U831,L77,U609,L629,D953,R491,D17,R160,U468,R519,D41,R625,D501,R106,D500,R473,D244,R471,U252,R440,U326,R710,D645,L190,D670,L624,D37,L46,D242,L513,D179,R192,D100,R637,U622,R322,U548,L192,D85,L319,D717,L254,D742,L756,D624,L291,D663,R994,U875,R237,U304,R40,D399,R407,D124,R157,D415,L405,U560,R607,U391,R409,U233,R305,U346,L233,U661,R213,D56,L558,U386,R830,D23,L75,D947,L511,D41,R927,U856,L229,D20,L717,D830,R584,U485,R536,U531,R946,U942,R207,D237,L762,U333,L979,U29,R635,D386,R267,D260,R484,U887,R568,D451,R149,U92,L379,D170,R135,U799,L617,D380,L872,U868,R48,U279,R817,U572,L728,D792,R833,U788,L940,D306,R230,D570,L137,U419,L429,D525,L730,U333,L76,D435,R885,U811,L937,D320,R152,U906,L461,U227,L118,U951,R912,D765,L638,U856,L193,D615,L347,U303,R317,U23,L139,U6,L525,U308,L624,U998,R753,D901,R556,U428,L224,U953,R804,D632,L764,U808,L487,U110,L593,D747,L659,D966,R988,U217,L657,U615,L425,D626,L194,D802,L440,U209,L28,U110,L564,D47,R698,D938,R13,U39,R703,D866,L422,D855,R535,D964,L813,D405,R116,U762,R974,U568,R934,U574,R462,D968,R331,U298,R994,U895,L204,D329,R982,D83,L301,D197,L36,U329,R144,U497,R300,D551,L74,U737,R591,U374,R815,U771,L681
2+
L997,D154,R652,U379,L739,U698,R596,D862,L125,D181,R786,U114,R536,U936,L144,U936,R52,U899,R88,D263,R122,D987,L488,U303,R142,D556,L691,D769,L717,D445,R802,U294,L468,D13,R301,D651,L242,D767,R465,D360,L144,D236,R59,U815,R598,U375,R645,U905,L714,U440,R932,D160,L420,U361,L433,D485,L276,U458,R760,D895,R999,U263,R530,U691,L918,D790,L150,U574,R800,U163,R478,U112,L353,U30,L763,U239,L353,U619,R669,D822,R688,U484,L678,D88,R946,D371,L209,D175,R771,D85,R430,U16,R610,D326,R836,U638,L387,D996,L758,U237,L476,U572,L456,U579,L457,D277,L825,U204,R277,U267,L477,D573,L659,D163,L516,D783,R762,U146,L387,U700,R911,U335,L115,D887,R677,U312,R707,U463,L743,U358,L715,D603,R966,U21,L857,D680,R182,D977,L279,U196,R355,D624,L434,U410,R385,U47,L999,D542,L453,D735,R781,U115,R814,U110,R344,D139,R899,D650,L118,D774,L227,D140,L198,D478,R115,D863,R776,D935,R473,U722,R555,U528,L912,U268,R776,D223,L302,D878,R90,U52,L595,U898,L210,U886,R161,D794,L846,U404,R323,U616,R559,U510,R116,D740,L554,U231,R54,D328,L56,U750,R347,U376,L148,U454,L577,U61,L772,D862,R293,U82,L676,D508,L53,D860,L974,U733,R266,D323,L75,U218,L390,U757,L32,D455,R34,D363,L336,D67,R222,D977,L809,D909,L501,U483,L541,U923,R97,D437,L296,D941,L652,D144,L183,U369,L629,U535,L825,D26,R916,U131,R753,U383,L653,U631,R280,U500,L516,U959,R858,D830,R357,D87,R885,D389,L838,U550,R262,D529,R34,U20,L25,D553,L884,U806,L800,D988,R499,D360,R435,U381,R920,D691,R373,U714,L797,D677,L490,D976,L734,D585,L384,D352,R54,D23,R339,D439,L939,U104,L651,D927,L152

‎src/clj_adventofcode_2019/day03.clj‎

Lines changed: 142 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,142 @@
1+
(ns clj-adventofcode-2019.day03
2+
(:require [clojure.java.io :as io]))
3+
4+
;--- Day 3: Crossed Wires ---
5+
;The gravity assist was successful, and you're well on your way to the Venus refuelling station. During the rush back on Earth, the fuel management system wasn't completely installed, so that's next on the priority list.
6+
;
7+
;Opening the front panel reveals a jumble of wires. Specifically, two wires are connected to a central port and extend outward on a grid. You trace the path each wire takes as it leaves the central port, one wire per line of text (your puzzle input).
8+
;
9+
;The wires twist and turn, but the two wires occasionally cross paths. To fix the circuit, you need to find the intersection point closest to the central port. Because the wires are on a grid, use the Manhattan distance for this measurement. While the wires do technically cross right at the central port where they both start, this point does not count, nor does a wire count as crossing with itself.
10+
;
11+
;For example, if the first wire's path is R8,U5,L5,D3, then starting from the central port (o), it goes right 8, up 5, left 5, and finally down 3:
12+
;
13+
;...........
14+
;...........
15+
;...........
16+
;....+----+.
17+
;....|....|.
18+
;....|....|.
19+
;....|....|.
20+
;.........|.
21+
;.o-------+.
22+
;...........
23+
;Then, if the second wire's path is U7,R6,D4,L4, it goes up 7, right 6, down 4, and left 4:
24+
;
25+
;...........
26+
;.+-----+...
27+
;.|.....|...
28+
;.|..+--X-+.
29+
;.|..|..|.|.
30+
;.|.-X--+.|.
31+
;.|..|....|.
32+
;.|.......|.
33+
;.o-------+.
34+
;...........
35+
;These wires cross at two locations (marked X), but the lower-left one is closer to the central port: its distance is 3 + 3 = 6.
36+
;
37+
;Here are a few more examples:
38+
;
39+
;R75,D30,R83,U83,L12,D49,R71,U7,L72
40+
;U62,R66,U55,R34,D71,R55,D58,R83 = distance 159
41+
;R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51
42+
;U98,R91,D20,R16,D67,R40,U7,R15,U6,R7 = distance 135
43+
;What is the Manhattan distance from the central port to the closest intersection?
44+
45+
(def data-file (io/resource "day03_input.txt"))
46+
47+
(def wire-paths (map (fn [line] (clojure.string/split line #",")) (clojure.string/split-lines (slurp data-file))))
48+
49+
(defn parse-direction [direction]
50+
(let [
51+
first-char (first direction)
52+
vec (case first-char
53+
\R [ 1 0]
54+
\L [-1 0]
55+
\U [ 0 1]
56+
\D [ 0 -1])
57+
times (Integer/parseInt (subs direction 1))
58+
] {:vec vec :times times}))
59+
60+
(defn add-vector [[x1, y1] [x2 y2]] [(+ x1 x2) (+ y1 y2)])
61+
62+
(def central-port [0 0])
63+
64+
(defn calc-coordinates [last-coordinate direction]
65+
(let [parsed-direction (parse-direction direction)]
66+
(rest
67+
(take (inc (:times parsed-direction))
68+
(iterate (partial add-vector (:vec parsed-direction))
69+
last-coordinate)))))
70+
71+
(defn path-to-coordinates
72+
([path] (path-to-coordinates [central-port] path))
73+
([coordinates path]
74+
(if (empty? path)
75+
coordinates
76+
(let [
77+
last-coordinate (last coordinates)
78+
next-direction (first path)
79+
new-coordinates (calc-coordinates last-coordinate next-direction)
80+
]
81+
(recur (concat coordinates new-coordinates) (rest path))
82+
))))
83+
84+
(defn common-coordinates [first second]
85+
(clojure.set/intersection (set first) (set second)))
86+
87+
(defn manhattan-distance [[x y ]] (+ (Math/abs (int x)) (Math/abs (int y))))
88+
89+
90+
(def all-intersections (apply common-coordinates (map path-to-coordinates wire-paths)))
91+
92+
(def part1-solution
93+
(first (sort
94+
(filter (fn [[distance v]] (> distance 0))
95+
(map (fn [v] [(manhattan-distance v) v]) all-intersections)))))
96+
97+
;--- Part Two ---
98+
;It turns out that this circuit is very timing-sensitive; you actually need to minimize the signal delay.
99+
;
100+
;To do this, calculate the number of steps each wire takes to reach each intersection; choose the intersection where the sum of both wires' steps is lowest. If a wire visits a position on the grid multiple times, use the steps value from the first time it visits that position when calculating the total value of a specific intersection.
101+
;
102+
;The number of steps a wire takes is the total number of grid squares the wire has entered to get to that location, including the intersection being considered. Again consider the example from above:
103+
;
104+
;...........
105+
;.+-----+...
106+
;.|.....|...
107+
;.|..+--X-+.
108+
;.|..|..|.|.
109+
;.|.-X--+.|.
110+
;.|..|....|.
111+
;.|.......|.
112+
;.o-------+.
113+
;...........
114+
;In the above example, the intersection closest to the central port is reached after 8+5+5+2 = 20 steps by the first wire and 7+6+4+3 = 20 steps by the second wire for a total of 20+20 = 40 steps.
115+
;
116+
;However, the top-right intersection is better: the first wire takes only 8+5+2 = 15 and the second wire takes only 7+6+2 = 15, a total of 15+15 = 30 steps.
117+
;
118+
;Here are the best steps for the extra examples from above:
119+
;
120+
;R75,D30,R83,U83,L12,D49,R71,U7,L72
121+
;U62,R66,U55,R34,D71,R55,D58,R83 = 610 steps
122+
;R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51
123+
;U98,R91,D20,R16,D67,R40,U7,R15,U6,R7 = 410 steps
124+
;What is the fewest combined steps the wires must take to reach an intersection?
125+
126+
(def coordinate-lines (map path-to-coordinates wire-paths))
127+
(def real-intersections (filter (partial not= [0 0]) all-intersections))
128+
129+
(defn steps-to-coordinate [line coordinate]
130+
(ffirst
131+
(filter (fn [[steps c]] (= coordinate c)) (map-indexed vector line))))
132+
133+
(def real-intersections-with-steps (map (fn [intersection]
134+
(let [
135+
l1-steps (steps-to-coordinate (first coordinate-lines) intersection)
136+
l2-steps (steps-to-coordinate (second coordinate-lines) intersection)
137+
] [(+ l1-steps l2-steps) intersection])
138+
) real-intersections))
139+
140+
(def part2-solution
141+
(ffirst
142+
(sort real-intersections-with-steps)))

0 commit comments

Comments
 (0)