-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
141 lines (110 loc) · 2.26 KB
/
main.go
File metadata and controls
141 lines (110 loc) · 2.26 KB
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
package main
import (
"bufio"
"fmt"
"io"
"os"
"path"
"strings"
)
func input() *os.File {
input, err := os.Open(path.Join("2020", "11", "input.txt"))
if err != nil {
panic(err)
}
return input
}
func parse(r io.Reader) [][]byte {
var seats [][]byte
clone := func(source []byte) []byte {
cloned := make([]byte, len(source))
copy(cloned, source)
return cloned
}
scanner := bufio.NewScanner(r)
for scanner.Scan() {
seats = append(seats, clone(scanner.Bytes()))
}
if scanner.Err() != nil {
panic(scanner.Err())
}
return seats
}
const (
occupied = '#'
empty = 'L'
floor = '.'
)
func occupiedAdjacentSeats(seats [][]byte, i, j int) int {
numOccupied := 0
isInvalid := func(x, y int) bool {
return x < 0 || x >= len(seats) || y < 0 || y >= len(seats[x])
}
for _, xOffset := range []int{1, 0, -1} {
for _, yOffset := range []int{1, 0, -1} {
if xOffset == 0 && yOffset == 0 {
continue
}
x := i + xOffset
y := j + yOffset
if isInvalid(x, y) {
continue
}
for !isInvalid(x, y) && seats[x][y] == floor {
x += xOffset
y += yOffset
}
if isInvalid(x, y) {
continue
}
if seats[x][y] == occupied {
numOccupied += 1
}
}
}
return numOccupied
}
type pos struct {
x, y int
}
func update(seats [][]byte) bool {
changes := make(map[pos]byte)
for i := 0; i < len(seats); i++ {
for j := 0; j < len(seats[i]); j++ {
seat := seats[i][j]
if seat == floor {
continue
}
numOccupied := occupiedAdjacentSeats(seats, i, j)
if seat == empty && numOccupied == 0 {
changes[pos{i, j}] = occupied
} else if seat == occupied && numOccupied >= 5 {
changes[pos{i, j}] = empty
}
}
}
for pos, v := range changes {
seats[pos.x][pos.y] = v
}
return len(changes) != 0
}
func numOccupied(seats [][]byte) int {
occupiedSeats := 0
for _, row := range seats {
for _, seat := range row {
if seat == occupied {
occupiedSeats += 1
}
}
}
return occupiedSeats
}
func solve(seats [][]byte) int {
for update(seats) {
}
return numOccupied(seats)
}
func main() {
fmt.Println(solve(parse(strings.NewReader("L.LL.LL.LL\nLLLLLLL.LL\nL.L.L..L..\nLLLL.LL.LL\nL.LL.LL.LL\nL.LLLLL.LL\n..L.L.....\nLLLLLLLLLL\nL.LLLLLL.L\nL.LLLLL.LL"))))
fmt.Println(solve(parse(input())))
}