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
|
#include "aoc.h"
#include "../day5/aoc.h"
#include <algorithm>
#include <set>
namespace aoc2019 {
static constexpr size_t size = 15;
struct check_t {
int* a;
int* b;
};
static void copy(int* s1, int* s2) {
for (size_t i = 0; i < size; i++) {
s1[i] = s2[i];
}
}
bool interrupt(size_t i, std::vector<int>& outputs, void* out) {
if (outputs.size() > 0) {
check_t* x = (check_t*)out;
if (x->b - x->a == 12) {
*(x->b + 2) = i;
*(x->a + 1) = outputs[0];
} else {
*(x->b + 2) = i;
*(x->b + 4) = outputs[0];
}
return true;
}
return false;
}
int find_max(int* is, const std::vector<int>& codes) {
// auto print = [](int* is) {
// for (size_t i = 0; i < size; i++) {
// printf("%d ", is[i]);
// }
// printf("\n");
// };
auto equal = [](int* s1, int* s2) -> bool {
for (size_t i = 0; i < size; i++) {
if (s1[i] != s2[i]) {
return false;
}
}
return true;
};
int is1[size] = {0};
std::vector<int> cs[] = {codes, codes, codes, codes, codes};
bool stop{false};
while (!stop) {
copy(is1, is);
for (size_t i = 0; i < size; i += 3) {
std::vector<int> outputs;
check_t chk{is, &is[i]};
is[i + 2] == 0 ? set_computer(&is[i]) : set_computer(&is[i + 1]);
run_computer(is[i + 2], cs[i / 3], outputs, interrupt, &chk);
}
stop = equal(is1, is);
// print(is);
}
return is[1];
}
void find_max_loopback(int* is, int i, std::set<int>& ns, int* max, const std::vector<int>& codes) {
if (i == 15) {
int xs[size] = {0};
copy(xs, is);
int n = find_max(xs, codes);
// printf("%d %d %d %d %d -> %d\n", xs[0], xs[3], xs[6], xs[9], xs[12], n);
if (n > *max) {
*max = n;
}
} else {
for (int x : {5, 6, 7, 8, 9}) {
if (ns.find(x) != ns.end()) {
continue;
} else {
is[i] = x;
ns.insert(x);
find_max_loopback(is, i + 3, ns, max, codes);
ns.erase(x);
}
}
}
}
void find_max(int* is, int i, std::set<int>& ns, int* max, const std::vector<int>& codes) {
if (i == 10) {
set_computer(&is[i - 2]);
int n = run_computer(codes);
// printf("%d %d %d %d %d -> %d\n", is[0], is[2], is[4], is[6], is[8], n);
if (n > *max) {
*max = n;
}
} else {
for (int x : {0, 1, 2, 3, 4}) {
if (ns.find(x) != ns.end()) {
continue;
} else {
is[i] = x;
if (i > 0) {
set_computer(&is[i - 2]);
is[i + 1] = run_computer(codes);
}
ns.insert(x);
find_max(is, i + 2, ns, max, codes);
ns.erase(x);
}
}
}
}
static void get_number(const char** pp, int* d) {
const char* p = *pp;
int sign = 1;
if (*p == '-') {
sign = -1;
p++;
}
while (*p >= '0' && *p <= '9') {
*d = *d * 10 + *p - '0';
p++;
}
*d *= sign;
*pp = p;
}
std::pair<int, int> day7(line_view file) {
std::vector<int> codes;
const char* p = file.line;
while (p < file.line + file.length) {
if ((*p >= '0' && *p <= '9') || *p == '-') {
int d{0};
get_number(&p, &d);
codes.push_back(d);
}
p++;
}
int m1{INT32_MIN};
int is1[10] = {0};
std::set<int> ns1;
find_max(is1, 0, ns1, &m1, codes);
int m2{INT32_MIN};
int is2[15] = {0};
std::set<int> ns2;
find_max_loopback(is2, 0, ns2, &m2, codes);
return {m1, m2};
}
} // namespace aoc2019
|
