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
|
#include "common.h"
#include <stdint.h>
#include <vector>
namespace aoc2022 {
struct monkey_map {
int start;
line_view line;
void print() const noexcept {
for (int i = 0; i < start; i++) {
printf(" ");
}
const char* p = line.line;
for (size_t i = 0; i < line.length; i++) {
printf("%c", *(p + i));
}
printf("\n");
}
monkey_map(const char* p) {
const char* p0 = p;
while (*p == ' ')
p++;
start = p - p0;
p0 = p;
while (*p == '.' || *p == '#')
p++;
line = {p0, p};
}
};
struct trace_map {
char* p = nullptr;
trace_map(const monkey_map& m) {
p = (char*)malloc(m.start + m.line.length + 1);
for (int i = 0; i < m.start; i++) {
*(p + i) = ' ';
}
for (size_t i = 0; i < m.line.length; i++) {
*(p + m.start + i) = *(m.line.line + i);
}
*(p + m.start + m.line.length) = '\n';
}
void print() const noexcept {
char* px = p;
while (true) {
printf("%c", *px);
if (*px == '\n')
break;
px++;
}
}
};
// Facing is 0 for right (>), 1 for down (v), 2 for left (<), and 3 for up (^)
enum facing {
right,
down,
left,
up,
};
struct route {
bool is_step = true;
char lr;
union {
int steps = 0;
facing f;
} ins;
void print(facing* f) const noexcept {
if (is_step) {
printf("%d", ins.steps);
} else {
switch (*f) {
case right:
printf("%c", ins.f == up ? 'L' : 'R');
break;
case down:
printf("%c", ins.f == left ? 'R' : 'L');
break;
case left:
printf("%c", ins.f == up ? 'R' : 'L');
break;
case up:
printf("%c", ins.f == left ? 'L' : 'R');
break;
}
*f = ins.f;
}
}
route(const char** pp, facing* ff) {
const char* p = *pp;
if (*p >= '0' && *p <= '9') {
while (*p >= '0' && *p <= '9') {
ins.steps = ins.steps * 10 + *p - '0';
p++;
}
*pp = p;
} else {
is_step = false;
lr = *p;
switch (*p) {
case 'L': {
switch (*ff) {
case right:
*ff = up;
ins.f = up;
break;
case down:
*ff = right;
ins.f = right;
break;
case left:
*ff = down;
ins.f = down;
break;
case up:
*ff = left;
ins.f = left;
break;
}
} break;
case 'R': {
switch (*ff) {
case right:
*ff = down;
ins.f = down;
break;
case down:
*ff = left;
ins.f = left;
break;
case left:
*ff = up;
ins.f = up;
break;
case up:
*ff = right;
ins.f = right;
break;
}
} break;
default:
break;
}
*pp = p + 1;
}
}
};
struct cube_map {
// constexpr static int size = 4;
constexpr static int size = 50;
struct {
cube_map* m;
facing f;
} sides[4]; // right, down, left, up
int x;
int y;
};
std::pair<int64_t, int64_t> day22(line_view);
} // namespace aoc2022
|
