-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay04.c
More file actions
169 lines (127 loc) · 4.49 KB
/
Day04.c
File metadata and controls
169 lines (127 loc) · 4.49 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
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
#include "Helpers.c"
typedef struct {
int number;
bool marked;
} Number;
typedef Number Board[5][5];
typedef struct {
int firstWinningNumber;
Board firstWinningBoard;
int lastWinningNumber;
Board lastWinningBoard;
} Bingo;
typedef struct {
int numbers[256];
int numbersCount;
Board boards[256];
int boardsCount;
} Input;
static void parse(const char *inputString, Input *input) {
int charsRead = 0;
int filled = 0;
char numbersString[1024] = {0};
assert(sscanf(inputString, "%1023s\n\n%n", numbersString, &charsRead) == 1);
assert((size_t)charsRead < sizeof(numbersString));
char *numbersStringPtr = numbersString;
while ((filled = sscanf(numbersStringPtr, "%u,%n", input->numbers + input->numbersCount++, &charsRead)) == 1) {
numbersStringPtr += charsRead;
}
assert(input->numbersCount > 0);
const char *rawInputBoards = inputString + (numbersStringPtr - numbersString);
for (filled = 0; filled != EOF; ++input->boardsCount) {
Board *board = &input->boards[input->boardsCount];
for (int col = 0; col < 5 && filled != EOF; ++col) {
filled = sscanf(rawInputBoards, "%u %u %u %u %u\n%n",
&(*board)[col][0].number,
&(*board)[col][1].number,
&(*board)[col][2].number,
&(*board)[col][3].number,
&(*board)[col][4].number,
&charsRead);
rawInputBoards += charsRead;
}
if (filled == EOF) {
--input->boardsCount;
}
}
assert(input->boardsCount > 0);
}
static void playBingo(Input *input, Bingo *bingo) {
bool firstWin = false;
bool alreadyWonBoards[input->boardsCount];
memset(alreadyWonBoards, false, (uint32_t)input->boardsCount * sizeof(bool));
for (int i = 0; i < input->numbersCount; ++i) {
int number = input->numbers[i];
for (int b = 0; b < input->boardsCount; ++b) {
Board *board = input->boards + b;
for (int col = 0; col < 5; ++col) {
for (int row = 0; row < 5; ++row) {
if ((*board)[col][row].number == number) {
(*board)[col][row].marked = true;
}
}
}
for (int col = 0; col < 5; ++col) {
int rowMarks = 0;
int colMarks = 0;
for (int row = 0; row < 5; ++row) {
if ((*board)[col][row].marked) {
++rowMarks;
}
if ((*board)[row][col].marked) {
++colMarks;
}
}
if (rowMarks == 5 || colMarks == 5) {
if (!firstWin) {
firstWin = true;
bingo->firstWinningNumber = number;
memcpy(bingo->firstWinningBoard, board, sizeof(Board));
}
if (!alreadyWonBoards[b]) {
alreadyWonBoards[b] = true;
bingo->lastWinningNumber = number;
memcpy(bingo->lastWinningBoard, board, sizeof(Board));
}
}
}
}
}
}
static int sumUnmarked(const Board *board) {
int sum = 0;
for (int col = 0; col < 5; ++col) {
for (int row = 0; row < 5; ++row) {
if (!(*board)[col][row].marked) {
sum += (*board)[col][row].number;
}
}
}
return sum;
}
static int partOne(const Input *input) {
Input inputCopy = {0};
memcpy(&inputCopy, input, sizeof(inputCopy));
Bingo bingo = {0};
playBingo(&inputCopy, &bingo);
return sumUnmarked(&bingo.firstWinningBoard) * bingo.firstWinningNumber;
}
static int partTwo(const Input *input) {
Input inputCopy = {0};
memcpy(&inputCopy, input, sizeof(inputCopy));
Bingo bingo = {0};
playBingo(&inputCopy, &bingo);
return sumUnmarked(&bingo.lastWinningBoard) * bingo.lastWinningNumber;
}
int main() {
const char *input = Helpers_readInputFile(__FILE__);
Input inputBoards = {0};
parse(input, &inputBoards);
Helpers_assert(PART1, Helpers_clock(),
partOne(&inputBoards),
4512, 21607);
Helpers_assert(PART2, Helpers_clock(),
partTwo(&inputBoards),
1924, 19012);
return 0;
}