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
|
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
|
+
+
+
+
+
+
+
+
+
-
+
+
-
+
+
+
+
+
+
+
+
+
+
+
+
+
|
#endif
/* === aoc202505 =======================================================
===================================================================== */
struct Range {
long long unsigned lo, hi;
};
int ascending(const void *a, const void *b) {
const struct Range *aa = a, *bb = b;
if (aa->lo < bb->lo) return -1;
if (aa->lo > bb->lo) return 1;
return 0;
}
void aoc202505(char *data, size_t len) {
(void)len; // unused argument
struct Range r[200] = {0};
size_t nr = 0;
char *err;
for (;;) {
// read ranges
char *minus = strchr(data, '-');
if (!minus) break;
*minus = 0;
r[nr].lo = strtoull(data, &err, 10);
*minus++ = '-';
char *enter = strchr(minus, '\n');
*enter = 0;
r[nr++].hi = strtoull(minus, &err, 10);
*enter++ = '\n';
data = enter;
}
unsigned fresh = 0;
for (;;) {
// read and process single entries
long long unsigned item = strtoull(data, &err, 10);
if (err[0] != '\n') break;
if (item == 0) break;
// pause for brain storming pause
for (;;) {
int mergecount = 0;
for (size_t k = 1; k < nr, k++) {
for (size_t kk = 0; kk < k; kk++) {
mergecount += merge(r, kk, k) {
mergecount++;
nr--;
}
}
}
if (mergecount == 0) break;
}
#endif
}
/* === aoc202504 =======================================================
===================================================================== */
static unsigned evolve(struct RectangularMap *rm, unsigned src) {
unsigned changes = 0;
unsigned dst = 1 - src;
|