blob: 7999e2591e86efe206c9e89cf2a66f7cf1f77709 (
plain)
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
|
#include "common.h"
#include <vector>
namespace aoc2022 {
struct packet {
enum componet_t {
is_int,
is_list,
};
struct componet {
componet_t t;
int v = 0;
packet *p = nullptr;
};
std::vector<componet*> ps;
static void get_number(const char** p, int* d) {
const char* p0 = *p;
while (*p0 >= '0' && *p0 <= '9') {
*d = 10 * (*d) + *p0 - '0';
p0++;
}
*p = p0;
}
static void load(const char** p, packet** pp) {
const char* p0 = *p;
while (*p0 != '\n') {
p0++;
if (*p0 >= '0' && *p0 <= '9') {
componet* c = new componet;
c->t = is_int;
get_number(&p0, &c->v);
(*pp)->ps.push_back(c);
}
else if (*p0 == '[') {
componet* c = new componet;
c->t = is_list;
c->p = new packet;
load(&p0, &c->p);
(*pp)->ps.push_back(c);
}
else if (*p0 == ']') {
*p = p0;
return;
}
}
}
static packet* make_packet(int v) {
componet* c = new componet;
c->p = nullptr;
c->t = is_int;
c->v = v;
packet* p = new packet;
p->ps.push_back(c);
return p;
}
friend bool operator<(const packet& p1, const packet& p2) {
for (size_t i = 0; i < p1.ps.size() && i < p2.ps.size(); i++) {
componet* c1 = p1.ps[i];
componet* c2 = p2.ps[i];
if (c1->t == is_int && c2->t == is_int) {
// printf("compare %d %d\n", c1->v, c2->v);
if (c1->v < c2->v) return true;
if (c1->v > c2->v) return false;
}
if (c1->t == is_int && c2->t == is_list) {
packet *p = make_packet(c1->v);
return *p < *(c2->p);
}
if (c1->t == is_list && c2->t == is_int) {
packet *p = make_packet(c2->v);
return *(c1->p) < *(p);
}
if (c1->t == is_list && c2->t == is_list) {
return *(c1->p) < *(c2->p);
}
}
return p1.ps.size() <= p2.ps.size();
}
};
std::pair<int, int> day13(line_view);
}
|
