|
| 1 | +package main |
| 2 | + |
| 3 | +import ( |
| 4 | + "fmt" |
| 5 | + "log" |
| 6 | + "os" |
| 7 | + |
| 8 | + "github.com/kfarnung/advent-of-code/2024/lib" |
| 9 | +) |
| 10 | + |
| 11 | +type point struct { |
| 12 | + x, y int |
| 13 | +} |
| 14 | + |
| 15 | +func part1(input string) int64 { |
| 16 | + garden := parseInput(input) |
| 17 | + |
| 18 | + sum := int64(0) |
| 19 | + seen := make(map[point]bool) |
| 20 | + |
| 21 | + for i, row := range garden { |
| 22 | + for j := range row { |
| 23 | + location := point{i, j} |
| 24 | + if seen[location] { |
| 25 | + continue |
| 26 | + } |
| 27 | + |
| 28 | + area, perimeter := findAreaAndPerimeter(garden, i, j, seen) |
| 29 | + sum += area * perimeter |
| 30 | + } |
| 31 | + } |
| 32 | + |
| 33 | + return sum |
| 34 | +} |
| 35 | + |
| 36 | +func part2(_ string) int64 { |
| 37 | + return int64(0) |
| 38 | +} |
| 39 | + |
| 40 | +func findAreaAndPerimeter(garden [][]rune, i, j int, seen map[point]bool) (int64, int64) { |
| 41 | + area := int64(0) |
| 42 | + perimeter := int64(0) |
| 43 | + region := garden[i][j] |
| 44 | + |
| 45 | + var queue []point |
| 46 | + queue = append(queue, point{x: i, y: j}) |
| 47 | + |
| 48 | + for len(queue) > 0 { |
| 49 | + current := queue[0] |
| 50 | + queue = queue[1:] |
| 51 | + |
| 52 | + if seen[current] { |
| 53 | + continue |
| 54 | + } |
| 55 | + |
| 56 | + seen[current] = true |
| 57 | + area++ |
| 58 | + |
| 59 | + if current.x > 0 && garden[current.x-1][current.y] == region { |
| 60 | + queue = append(queue, point{x: current.x - 1, y: current.y}) |
| 61 | + } else { |
| 62 | + perimeter++ |
| 63 | + } |
| 64 | + |
| 65 | + if current.x < len(garden)-1 && garden[current.x+1][current.y] == region { |
| 66 | + queue = append(queue, point{x: current.x + 1, y: current.y}) |
| 67 | + } else { |
| 68 | + perimeter++ |
| 69 | + } |
| 70 | + |
| 71 | + if current.y > 0 && garden[current.x][current.y-1] == region { |
| 72 | + queue = append(queue, point{x: current.x, y: current.y - 1}) |
| 73 | + } else { |
| 74 | + perimeter++ |
| 75 | + } |
| 76 | + |
| 77 | + if current.y < len(garden[0])-1 && garden[current.x][current.y+1] == region { |
| 78 | + queue = append(queue, point{x: current.x, y: current.y + 1}) |
| 79 | + } else { |
| 80 | + perimeter++ |
| 81 | + } |
| 82 | + } |
| 83 | + |
| 84 | + return area, perimeter |
| 85 | +} |
| 86 | + |
| 87 | +func parseInput(input string) [][]rune { |
| 88 | + var data [][]rune |
| 89 | + for _, line := range lib.SplitLines(input) { |
| 90 | + if len(line) == 0 { |
| 91 | + continue |
| 92 | + } |
| 93 | + |
| 94 | + data = append(data, []rune(line)) |
| 95 | + } |
| 96 | + |
| 97 | + return data |
| 98 | +} |
| 99 | + |
| 100 | +func main() { |
| 101 | + name := os.Args[1] |
| 102 | + content, err := lib.LoadFileContent(name) |
| 103 | + if err != nil { |
| 104 | + log.Fatal(err) |
| 105 | + } |
| 106 | + |
| 107 | + fmt.Printf("Part 1: %d\n", part1(content)) |
| 108 | + fmt.Printf("Part 2: %d\n", part2(content)) |
| 109 | +} |
0 commit comments