mirror of
https://github.com/Threnklyn/advent-of-code-go.git
synced 2026-06-07 12:45:10 +02:00
might be making a mistake starting 2018...
This commit is contained in:
alexchao26
@@ -0,0 +1,2 @@
|
||||
R1008,U428,L339,U16,R910,U221,R53,D546,L805,U376,L19,U708,R493,D489,L443,D567,R390,D771,R270,U737,R926,U181,L306,D456,L668,D79,L922,U433,L701,U472,R914,U903,L120,U199,L273,D206,L967,U711,R976,U976,R603,U8,L882,U980,R561,D697,L224,D620,L483,U193,R317,D588,L932,D990,R658,U998,L136,U759,R463,U890,L297,U648,R163,U250,R852,U699,R236,D254,L173,U720,L259,U632,L635,U426,R235,D699,R411,U650,L258,D997,L781,D209,L697,D306,L793,U657,L936,U317,R549,D798,L951,D80,R591,D480,R835,U292,L722,U987,L775,U173,R353,U404,L250,U652,L527,D282,L365,D657,L141,D301,R128,D590,L666,U478,L85,D822,L716,U68,R253,D186,R81,U741,L316,D615,L570,U407,L734,D345,L652,U362,L360,D791,R358,U190,L823,U274,L279,D998,L16,D644,L201,D469,R213,D487,L251,D395,R130,U902,L398,U201,L56,D850,R541,D661,R921,U647,R309,D550,L307,D68,R894,U653,L510,D375,R20,U86,R357,D120,L978,D200,L45,D247,R906,U334,L242,D466,R418,U548,R698,D158,R582,U469,L968,U736,R196,U437,R87,D722,R811,U625,L425,D675,L904,D331,R693,D491,R559,U540,L120,D975,R180,U224,R610,U260,L769,D486,R93,D300,L230,U181,L60,U910,L60,D554,L527,U37,R69,D649,R768,D835,L581,U932,L746,U170,L733,U40,L497,D957,R12,U686,R85,D461,R796,D142,R664,U787,R636,D621,R824,D421,R902,D686,L202,D839,R567,D129,L77,D917,L200,D106,R3,D546,L101,D762,R780,U334,L410,D190,R431,D828,L816,D529,R648,D449,L845,U49,R750,U864,L133,D822,R46,U475,L229,U929,L676,D793,R379,U71,L243,U640,L122,U183,R528,U22,R375,D928,R292,U796,R259,U325,L921,U489,L246,D153,L384,D684,L243,U65,L342,U662,R707
|
||||
L1008,D243,L602,D497,L395,U81,R589,U94,R640,D965,L397,D781,R464,U642,L130,D740,R938,D260,L106,D323,L626,U869,L495,U450,R640,D675,R602,D449,L542,U917,L244,U702,L644,D809,R902,U163,R118,U982,L867,D795,R546,U194,R397,D877,L354,D255,L477,U45,L707,D624,R806,U642,L926,D233,L800,U691,L990,D979,L431,U999,L423,D794,L238,U25,R986,U595,L167,U480,L555,U831,R496,U799,L897,D895,L993,D11,R486,U176,L90,U842,R499,U792,R787,U859,L100,U169,R170,D89,R297,D944,R362,D460,R147,U831,L45,U972,R582,D90,L934,U284,R555,U235,L138,U837,R965,U915,R928,U982,R157,D566,L953,U653,L629,U460,L335,D912,R355,D683,L710,D562,R392,D44,R707,D979,L749,D223,L776,D723,R735,D356,R49,U567,L563,D220,L868,U223,R448,D505,L411,U662,L188,D536,R55,U718,L108,D289,R435,U98,R775,U933,L127,D84,R253,D523,L2,D905,R266,U675,R758,D331,R122,U988,R215,D500,R89,U306,R833,U763,R570,D818,L985,U127,L87,D210,R355,D532,R870,U196,R695,U633,R170,D540,R506,U708,L663,U566,L633,U306,L452,U180,R463,D21,L220,D268,R608,U986,L493,D598,L957,D116,L454,D584,L405,U651,R352,U681,R807,U767,L988,U692,R474,U710,R607,U313,R711,U12,R371,D561,R72,U522,R270,U904,L49,U525,R562,U895,L232,D319,R902,D236,L601,D816,R836,U419,R610,U644,L733,U355,L836,U228,L895,D39,L44,D848,L965,U475,R56,U62,L458,U99,R236,D763,R912,U295,R515,U179,R20,D777,R511,D906,R903,U855,L507,D512,L63,D630,R442,U595,L701,U654,R238,D35,L31,D469,R6,D222,R132,D837,R921,U838,R986,D441,L950,D530,L397,U41,L81,D60,L245,D75,R620,D455,L937,D180,R215,D684,R724,U561,R479,D353,L501
|
||||
@@ -0,0 +1,101 @@
|
||||
package main
|
||||
|
||||
import (
|
||||
"adventofcode/util"
|
||||
"fmt"
|
||||
"math"
|
||||
"strconv"
|
||||
"strings"
|
||||
)
|
||||
|
||||
func main() {
|
||||
// read input file, split by the new line, then split each line by commas
|
||||
input := util.ReadFile("../input.txt")
|
||||
sli := strings.Split(input, "\n")
|
||||
|
||||
split1 := strings.Split(sli[0], ",")
|
||||
split2 := strings.Split(sli[1], ",")
|
||||
|
||||
coordsMap1 := makeCoordinatesMap(split1)
|
||||
coordsMap2 := makeCoordinatesMap(split2)
|
||||
|
||||
// the highest safe int32... https://golang.org/pkg/math/
|
||||
// start this at the highest possible value so it'll be easily overwriteable
|
||||
minDist := math.MaxInt32
|
||||
|
||||
// iterate over all keys & values in coordsMap1
|
||||
// if that is also in the other map, check if it has a better manhattan dist
|
||||
for key := range coordsMap1 {
|
||||
if _, ok := coordsMap2[key]; ok {
|
||||
if dist := manhattanDistance(key); dist < minDist {
|
||||
// update minDist if applicable
|
||||
minDist = dist
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fmt.Println("The lowest Manhattan Distance is", minDist)
|
||||
}
|
||||
|
||||
// make a map where string key represents coordinates
|
||||
// value is an int for distance of wire to this point
|
||||
func makeCoordinatesMap(directionsSlice []string) map[string]int {
|
||||
gridOfCoordinates := map[string]int{}
|
||||
prevX := 0
|
||||
prevY := 0
|
||||
runningLength := 0
|
||||
|
||||
for i := 0; i < len(directionsSlice); i++ {
|
||||
// grab the current element/direction
|
||||
v := directionsSlice[i]
|
||||
|
||||
// split this element into a slice of runes...
|
||||
runeSlice := []rune(v)
|
||||
|
||||
// stores number parsed off of this element
|
||||
num, _ := strconv.Atoi(string(runeSlice[1:len(runeSlice)]))
|
||||
|
||||
// loop from 0 to num and add to the map/gridOfCoordinates
|
||||
for num > 0 {
|
||||
// on each loop increment the runningLength, decrement num
|
||||
runningLength++
|
||||
num--
|
||||
switch runeSlice[0] {
|
||||
case 'R':
|
||||
prevX++
|
||||
case 'L':
|
||||
prevX--
|
||||
case 'U':
|
||||
prevY++
|
||||
case 'D':
|
||||
prevY--
|
||||
}
|
||||
|
||||
// set `${prevX}x${prevY}` to the map with runningLength as the value
|
||||
newCoord := strconv.Itoa(prevX) + "x" + strconv.Itoa(prevY)
|
||||
|
||||
if _, ok := gridOfCoordinates[newCoord]; !ok {
|
||||
gridOfCoordinates[newCoord] = runningLength
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return gridOfCoordinates
|
||||
}
|
||||
|
||||
func manhattanDistance(coord string) int {
|
||||
// parse coordinates off of the passed in string key
|
||||
split := strings.Split(coord, "x")
|
||||
x, _ := strconv.Atoi(split[0])
|
||||
y, _ := strconv.Atoi(split[1])
|
||||
|
||||
// ensure they're both positive
|
||||
if x < 0 {
|
||||
x *= -1
|
||||
}
|
||||
if y < 0 {
|
||||
y *= -1
|
||||
}
|
||||
|
||||
return x + y
|
||||
}
|
||||
@@ -0,0 +1,84 @@
|
||||
package main
|
||||
|
||||
import (
|
||||
"adventofcode/util"
|
||||
"fmt"
|
||||
"math"
|
||||
"strconv"
|
||||
"strings"
|
||||
)
|
||||
|
||||
func main() {
|
||||
// read input file, split by the new line, then split each line by commas
|
||||
input := util.ReadFile("../input.txt")
|
||||
sli := strings.Split(input, "\n")
|
||||
|
||||
split1 := strings.Split(sli[0], ",")
|
||||
split2 := strings.Split(sli[1], ",")
|
||||
|
||||
coordsMap1 := makeCoordinatesMap(split1)
|
||||
coordsMap2 := makeCoordinatesMap(split2)
|
||||
|
||||
lowestSumOfDistances := math.MaxInt32
|
||||
|
||||
// iterate over all keys & values in coordsMap1
|
||||
for key, value1 := range coordsMap1 {
|
||||
// check if the same key is in coordsMap2
|
||||
if value2, ok := coordsMap2[key]; ok {
|
||||
// update lowestSumOfDistances if applicable
|
||||
if lowestSumOfDistances > value1+value2 {
|
||||
lowestSumOfDistances = value1 + value2
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
fmt.Println("Lowest sum of distances", lowestSumOfDistances)
|
||||
}
|
||||
|
||||
// return a map that has keys of strings and a value of an int of steps to reach the coordinate
|
||||
func makeCoordinatesMap(directionsSlice []string) map[string]int {
|
||||
gridOfCoordinates := map[string]int{}
|
||||
prevX := 0
|
||||
prevY := 0
|
||||
runningLength := 0
|
||||
|
||||
for i := 0; i < len(directionsSlice); i++ {
|
||||
// grab the current element
|
||||
v := directionsSlice[i]
|
||||
|
||||
// split this element into a slice of runes...
|
||||
runeSlice := []rune(v)
|
||||
|
||||
// stores number parsed off of this element
|
||||
num, _ := strconv.Atoi(string(runeSlice[1:]))
|
||||
// fmt.Println(num)
|
||||
|
||||
// loop from 0 to num and add to the map/gridOfCoordinates
|
||||
for num > 0 {
|
||||
// on each loop increment the runningLength, decrement num
|
||||
runningLength++
|
||||
num--
|
||||
switch runeSlice[0] {
|
||||
case 'R':
|
||||
// if going right, increment prevX
|
||||
prevX++
|
||||
case 'L':
|
||||
prevX--
|
||||
case 'U':
|
||||
prevY++
|
||||
case 'D':
|
||||
prevY--
|
||||
}
|
||||
|
||||
// set `${prevX}x${prevY}` to the map with runningLength as the value
|
||||
newCoord := strconv.Itoa(prevX) + "x" + strconv.Itoa(prevY)
|
||||
|
||||
_, ok := gridOfCoordinates[newCoord]
|
||||
if ok == false {
|
||||
gridOfCoordinates[newCoord] = runningLength
|
||||
}
|
||||
}
|
||||
}
|
||||
// fmt.Println(gridOfCoordinates)
|
||||
return gridOfCoordinates
|
||||
}
|
||||
@@ -0,0 +1,75 @@
|
||||
--- Day 3: Crossed Wires ---
|
||||
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.
|
||||
|
||||
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).
|
||||
|
||||
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.
|
||||
|
||||
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:
|
||||
|
||||
...........
|
||||
...........
|
||||
...........
|
||||
....+----+.
|
||||
....|....|.
|
||||
....|....|.
|
||||
....|....|.
|
||||
.........|.
|
||||
.o-------+.
|
||||
...........
|
||||
Then, if the second wire's path is U7,R6,D4,L4, it goes up 7, right 6, down 4, and left 4:
|
||||
|
||||
...........
|
||||
.+-----+...
|
||||
.|.....|...
|
||||
.|..+--X-+.
|
||||
.|..|..|.|.
|
||||
.|.-X--+.|.
|
||||
.|..|....|.
|
||||
.|.......|.
|
||||
.o-------+.
|
||||
...........
|
||||
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.
|
||||
|
||||
Here are a few more examples:
|
||||
|
||||
R75,D30,R83,U83,L12,D49,R71,U7,L72
|
||||
U62,R66,U55,R34,D71,R55,D58,R83 = distance 159
|
||||
R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51
|
||||
U98,R91,D20,R16,D67,R40,U7,R15,U6,R7 = distance 135
|
||||
What is the Manhattan distance from the central port to the closest intersection?
|
||||
|
||||
Your puzzle answer was 2180.
|
||||
|
||||
--- Part Two ---
|
||||
It turns out that this circuit is very timing-sensitive; you actually need to minimize the signal delay.
|
||||
|
||||
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.
|
||||
|
||||
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:
|
||||
|
||||
...........
|
||||
.+-----+...
|
||||
.|.....|...
|
||||
.|..+--X-+.
|
||||
.|..|..|.|.
|
||||
.|.-X--+.|.
|
||||
.|..|....|.
|
||||
.|.......|.
|
||||
.o-------+.
|
||||
...........
|
||||
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.
|
||||
|
||||
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.
|
||||
|
||||
Here are the best steps for the extra examples from above:
|
||||
|
||||
R75,D30,R83,U83,L12,D49,R71,U7,L72
|
||||
U62,R66,U55,R34,D71,R55,D58,R83 = 610 steps
|
||||
R98,U47,R26,D63,R33,U87,L62,D20,R33,U53,R51
|
||||
U98,R91,D20,R16,D67,R40,U7,R15,U6,R7 = 410 steps
|
||||
What is the fewest combined steps the wires must take to reach an intersection?
|
||||
|
||||
Your puzzle answer was 112316.
|
||||
|
||||
Both parts of this puzzle are complete! They provide two gold stars: **
|
||||
Reference in New Issue
Block a user