code.go 2.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142
  1. package main
  2. import (
  3. "bufio"
  4. "fmt"
  5. "log"
  6. "os"
  7. "strings"
  8. )
  9. type Directions struct {
  10. left string
  11. right string
  12. }
  13. type Network struct {
  14. moves string
  15. paths map[string]Directions
  16. starts []string
  17. }
  18. func readInput(file *os.File) Network {
  19. scanner := bufio.NewScanner(file)
  20. var network Network
  21. readMoves := false
  22. for scanner.Scan() {
  23. line := scanner.Text()
  24. if line == "" {
  25. if !readMoves {
  26. readMoves = true
  27. continue
  28. }
  29. break
  30. }
  31. if !readMoves {
  32. network.moves = line
  33. network.paths = make(map[string]Directions)
  34. } else {
  35. fromParts := strings.Split(line, " = ")
  36. if len(fromParts) != 2 {
  37. log.Fatalf("Wrong number of fromParts: %s", line)
  38. }
  39. from := fromParts[0]
  40. parts := strings.Split(fromParts[1], ", ")
  41. if len(parts) != 2 {
  42. log.Fatalf("Wrong number of parts: %s", fromParts[1])
  43. }
  44. var directions Directions
  45. directions.left = strings.TrimLeft(parts[0], "(")
  46. directions.right = strings.TrimRight(parts[1], ")")
  47. network.paths[from] = directions
  48. if strings.HasSuffix(from, "A") {
  49. network.starts = append(network.starts, from)
  50. }
  51. }
  52. }
  53. return network
  54. }
  55. func part1(network Network) int {
  56. steps := 0
  57. current := "AAA"
  58. mod := len(network.moves)
  59. index := 0
  60. for {
  61. if current == "ZZZ" {
  62. break
  63. }
  64. d := network.paths[current]
  65. if network.moves[index] == 'L' {
  66. current = d.left
  67. } else {
  68. current = d.right
  69. }
  70. index = (index + 1) % mod
  71. steps++
  72. }
  73. return steps
  74. }
  75. func (n *Network) AtGoal() bool {
  76. for i := range n.starts {
  77. if !strings.HasSuffix(n.starts[i], "Z") {
  78. return false
  79. }
  80. }
  81. return true
  82. }
  83. func part2(network Network) int {
  84. steps := 0
  85. mod := len(network.moves)
  86. index := 0
  87. for {
  88. if network.AtGoal() {
  89. break
  90. }
  91. for i := range network.starts {
  92. d := network.paths[network.starts[i]]
  93. if network.moves[index] == 'L' {
  94. network.starts[i] = d.left
  95. } else {
  96. network.starts[i] = d.right
  97. }
  98. }
  99. steps++
  100. index = (index + 1) % mod
  101. }
  102. return steps
  103. }
  104. func main() {
  105. if len(os.Args) < 2 {
  106. log.Fatal("You need to specify a file!")
  107. }
  108. filePath := os.Args[1]
  109. file, err := os.Open(filePath)
  110. if err != nil {
  111. log.Fatalf("Failed to open %s!\n", filePath)
  112. }
  113. network := readInput(file)
  114. fmt.Println("Part1:", part1(network))
  115. fmt.Println("Part2:", part2(network))
  116. }