-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.go
194 lines (160 loc) · 3.16 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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
package main
import (
"bufio"
"fmt"
"io"
"os"
"path"
"strconv"
"strings"
)
func input() *os.File {
input, err := os.Open(path.Join("2021", "4", "input.txt"))
if err != nil {
panic(err)
}
return input
}
type pos struct {
num string
marked bool
}
func solve(r io.Reader) {
scanner := bufio.NewScanner(r)
var nums []string
var boards [][][]*pos
var currentBoard [][]*pos
for scanner.Scan() {
row := scanner.Text()
if nums == nil {
nums = strings.Split(row, ",")
continue
}
if len(row) == 0 {
if currentBoard != nil {
boards = append(boards, currentBoard)
currentBoard = nil
}
continue
}
currentBoard = append(currentBoard, makePos(strings.Split(row, " ")))
}
if scanner.Err() != nil {
panic(scanner.Err())
}
if currentBoard != nil {
boards = append(boards, currentBoard)
currentBoard = nil
}
var winners []winnert
for _, num := range nums {
mark(num, boards)
winnersThisRound := getWinners(boards)
for _, winner := range winnersThisRound {
winners = append(winners, winnert{
num: num,
winner: winner.winner,
})
boards[winner.num] = nil
}
if len(winners) == len(boards) {
break
}
}
winner := winners[len(winners)-1].winner
num := winners[len(winners)-1].num
numv, err := strconv.Atoi(num)
if err != nil {
panic(err)
}
fmt.Println(sumUnmarked(winner), numv, sumUnmarked(winner)*numv)
}
type winnert struct {
num string
winner [][]*pos
}
func mark(num string, boards [][][]*pos) {
for _, board := range boards {
for _, row := range board {
for _, pos := range row {
if pos.num == num {
pos.marked = true
}
}
}
}
}
func sumUnmarked(board [][]*pos) int {
v := 0
for _, row := range board {
for _, pos := range row {
if !pos.marked {
vv, err := strconv.Atoi(pos.num)
if err != nil {
panic(err)
}
v += vv
}
}
}
return v
}
type winnerWithPos struct {
num int
winner [][]*pos
}
func getWinners(boards [][][]*pos) []winnerWithPos {
var winners []winnerWithPos
for i, board := range boards {
if board == nil {
continue
}
if isWinner(board) {
winners = append(winners, winnerWithPos{
num: i,
winner: board,
})
}
}
return winners
}
func isWinner(board [][]*pos) bool {
for i := 0; i < len(board); i++ {
if areNumsMarked(board[i]) {
return true
}
var col []*pos
for _, row := range board {
col = append(col, row[i])
}
if areNumsMarked(col) {
return true
}
}
return false
}
func areNumsMarked(row []*pos) bool {
for _, p := range row {
if !p.marked {
return false
}
}
return true
}
func makePos(nums []string) []*pos {
var result []*pos
for _, v := range nums {
if v == "" {
continue
}
result = append(result, &pos{
num: v,
marked: false,
})
}
return result
}
func main() {
solve(strings.NewReader("7,4,9,5,11,17,23,2,0,14,21,24,10,16,13,6,15,25,12,22,18,20,8,19,3,26,1\n\n22 13 17 11 0\n 8 2 23 4 24\n21 9 14 16 7\n 6 10 3 18 5\n 1 12 20 15 19\n\n 3 15 0 2 22\n 9 18 13 17 5\n19 8 7 25 23\n20 11 10 24 4\n14 21 16 12 6\n\n14 21 17 24 4\n10 16 15 9 19\n18 8 23 26 20\n22 11 13 6 5\n 2 0 12 3 7"))
solve(input())
}