-
Notifications
You must be signed in to change notification settings - Fork 3
/
main.go
173 lines (158 loc) · 3.42 KB
/
main.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
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
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
package main
import (
"bufio"
"fmt"
"io"
)
func fs1(input io.Reader, steps int) (int, error) {
scanner := bufio.NewScanner(input)
var grid [][]bool
for scanner.Scan() {
line := scanner.Text()
runes := []rune(line)
row := make([]bool, len(runes))
for i, rune := range runes {
if rune == '#' {
row[i] = true
}
}
grid = append(grid, row)
}
lights := 0
for i := 0; i < steps; i++ {
grid, lights = round(grid)
}
return lights, nil
}
func round(grid [][]bool) ([][]bool, int) {
res := make([][]bool, len(grid))
for i, g := range grid {
res[i] = make([]bool, len(g))
}
sum := 0
for row := 0; row < len(grid); row++ {
for col := 0; col < len(grid[0]); col++ {
if grid[row][col] {
neighbors := get(grid, row-1, col-1) +
get(grid, row-1, col) +
get(grid, row-1, col+1) +
get(grid, row, col-1) +
get(grid, row, col+1) +
get(grid, row+1, col-1) +
get(grid, row+1, col) +
get(grid, row+1, col+1)
if neighbors == 2 || neighbors == 3 {
res[row][col] = true
sum++
}
} else {
neighbors := get(grid, row-1, col-1) +
get(grid, row-1, col) +
get(grid, row-1, col+1) +
get(grid, row, col-1) +
get(grid, row, col+1) +
get(grid, row+1, col-1) +
get(grid, row+1, col) +
get(grid, row+1, col+1)
if neighbors == 3 {
res[row][col] = true
sum++
}
}
}
}
return res, sum
}
func print(grid [][]bool) {
for _, row := range grid {
for _, col := range row {
if col {
fmt.Printf("#")
} else {
fmt.Printf(".")
}
}
fmt.Println()
}
fmt.Println()
}
func get(grid [][]bool, row, col int) int {
if row < 0 || col < 0 || row >= len(grid) || col >= len(grid[0]) {
return 0
}
if grid[row][col] {
return 1
}
return 0
}
func fs2(input io.Reader, steps int) (int, error) {
scanner := bufio.NewScanner(input)
var grid [][]bool
for scanner.Scan() {
line := scanner.Text()
runes := []rune(line)
row := make([]bool, len(runes))
for i, rune := range runes {
if rune == '#' {
row[i] = true
}
}
grid = append(grid, row)
}
grid[0][0] = true
grid[0][len(grid[0])-1] = true
grid[len(grid)-1][0] = true
grid[len(grid)-1][len(grid[0])-1] = true
lights := 0
for i := 0; i < steps; i++ {
grid, lights = round2(grid)
}
return lights, nil
}
func round2(grid [][]bool) ([][]bool, int) {
res := make([][]bool, len(grid))
for i, g := range grid {
res[i] = make([]bool, len(g))
}
sum := 0
for row := 0; row < len(grid); row++ {
for col := 0; col < len(grid[0]); col++ {
if (row == 0 && col == 0) ||
(row == 0 && col == len(grid[0])-1) ||
(row == len(grid)-1 && col == 0) ||
(row == len(grid)-1 && col == len(grid[0])-1) {
res[row][col] = true
sum++
continue
}
if grid[row][col] {
neighbors := get(grid, row-1, col-1) +
get(grid, row-1, col) +
get(grid, row-1, col+1) +
get(grid, row, col-1) +
get(grid, row, col+1) +
get(grid, row+1, col-1) +
get(grid, row+1, col) +
get(grid, row+1, col+1)
if neighbors == 2 || neighbors == 3 {
res[row][col] = true
sum++
}
} else {
neighbors := get(grid, row-1, col-1) +
get(grid, row-1, col) +
get(grid, row-1, col+1) +
get(grid, row, col-1) +
get(grid, row, col+1) +
get(grid, row+1, col-1) +
get(grid, row+1, col) +
get(grid, row+1, col+1)
if neighbors == 3 {
res[row][col] = true
sum++
}
}
}
}
return res, sum
}