1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
package main
import (
"fmt"
"os"
"strings"
)
func FileRead(path string) string {
file, err := os.ReadFile(path)
if err != nil {
fmt.Println("Couldn't Read file: ", err)
}
return string(file)
}
type Grid = [][]rune
func printGrid(grid [][]rune) {
for _, row := range grid {
for _, cell := range row {
fmt.Print(string(cell))
}
fmt.Println()
}
}
func parseInput(data string) Grid {
lines := strings.Split(data, "\n")
var grid Grid
for _, line := range lines {
if len(line) > 0 {
runes := []rune(line)
grid = append(grid, runes)
}
}
return grid
}
func inBounds(x, y, n, m int) bool {
return x >= 0 && x < n && y >= 0 && y < m
}
type Point = [2]int
type Points = [][2]int
func getPosMap(grid *Grid) map[rune]Points {
n, m := len(*grid), len((*grid)[0])
antinodes := make(map[rune]Points)
for i := 0; i < n; i++ {
for j := 0; j < m; j++ {
curPos := Point{i, j}
curRune := (*grid)[i][j]
if curRune != '.' {
antinodes[curRune] = append(antinodes[curRune], curPos)
}
}
}
return antinodes
}
func isValidAntenna(grid *Grid, i, j int) bool {
n, m := len(*grid), len((*grid)[0])
if inBounds(i, j, n, m) {
return true
}
return false
}
func solve_part_one(data string) int {
grid := parseInput(data)
antennas := getPosMap(&grid)
antinodes := make(map[Point]struct{})
for _, val := range antennas {
for i := 0; i < len(val); i++ {
curPosI := val[i]
for j := i + 1; j < len(val); j++ {
curPosJ := val[j]
diffOne := [2]int{curPosI[0] - curPosJ[0], curPosI[1] - curPosJ[1]}
diffTwo := [2]int{curPosJ[0] - curPosI[0], curPosJ[1] - curPosI[1]}
firstAntennaPos := [2]int{curPosI[0] + diffOne[0], curPosI[1] + diffOne[1]}
secondAntennaPos := [2]int{curPosJ[0] + diffTwo[0], curPosJ[1] + diffTwo[1]}
if isValidAntenna(&grid, firstAntennaPos[0], firstAntennaPos[1]) {
antinodes[firstAntennaPos] = struct{}{}
}
if isValidAntenna(&grid, secondAntennaPos[0], secondAntennaPos[1]) {
antinodes[secondAntennaPos] = struct{}{}
}
}
}
}
return len(antinodes)
}
func solve_part_two(data string) int {
grid := parseInput(data)
antennas := getPosMap(&grid)
cnt := 0
for _, val := range antennas {
for i := 0; i < len(val); i++ {
curPosI := val[i]
for j := i + 1; j < len(val); j++ {
curPosJ := val[j]
diffOne := [2]int{curPosI[0] - curPosJ[0], curPosI[1] - curPosJ[1]}
diffTwo := [2]int{curPosJ[0] - curPosI[0], curPosJ[1] - curPosI[1]}
firstAntennaPos := [2]int{curPosI[0] + diffOne[0], curPosI[1] + diffOne[1]}
secondAntennaPos := [2]int{curPosJ[0] + diffTwo[0], curPosJ[1] + diffTwo[1]}
for isValidAntenna(&grid, firstAntennaPos[0], firstAntennaPos[1]) {
grid[firstAntennaPos[0]][firstAntennaPos[1]] = '#'
firstAntennaPos = [2]int{firstAntennaPos[0] + diffOne[0], firstAntennaPos[1] + diffOne[1]}
}
for isValidAntenna(&grid, secondAntennaPos[0], secondAntennaPos[1]) {
grid[secondAntennaPos[0]][secondAntennaPos[1]] = '#'
secondAntennaPos = [2]int{secondAntennaPos[0] + diffTwo[0], secondAntennaPos[1] + diffTwo[1]}
}
}
}
}
for i := 0; i < len(grid); i++ {
for j := 0; j < len(grid); j++ {
if grid[i][j] != '.' {
cnt++
}
}
}
return cnt
}
func main() {
test := FileRead("../input/day08.test")
prod := FileRead("../input/day08.prod")
fmt.Println("Part_1 test: ", solve_part_one(test))
fmt.Println("Part_1 prod: ", solve_part_one(prod))
fmt.Println("Part_2 test: ", solve_part_two(test))
fmt.Println("Part_2 prod: ", solve_part_two(prod))
}
|
