-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathday21.go
54 lines (45 loc) · 926 Bytes
/
day21.go
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
package day21
import (
"image"
)
type Day struct{}
func (d Day) GetInput(lines []string) interface{} {
garden := make([][]rune, len(lines))
for i, line := range lines {
garden[i] = make([]rune, len(line))
for j, elem := range line {
garden[i][j] = elem
}
}
return garden
}
func (d Day) SolvePart1(gardenI interface{}) int {
garden := gardenI.([][]rune)
for step := 0; step < 64; step++ {
newGarden := deep(garden)
for i := range garden {
for j := range garden[i] {
if garden[i][j] != '#' {
if reachable(garden, image.Point{j, i}) {
newGarden[i][j] = 'O'
} else {
newGarden[i][j] = '.'
}
}
}
}
garden = newGarden
}
totalReachable := 0
for _, row := range garden {
for _, elem := range row {
if elem == 'O' || elem == 'S' {
totalReachable++
}
}
}
return totalReachable
}
func (d Day) SolvePart2(gardenI interface{}) int {
return -1
}