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
|
// Standard C++
#include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
// System
#include <md5.h>
using namespace std;
namespace {
using pos_type = tuple<int, int, string>;
string
md5(string_view input)
{
array<char, MD5_DIGEST_STRING_LENGTH> digest{};
MD5Data(input.data(), input.size(), digest.data());
return digest.data();
}
void
part1(const string& passcode)
{
static const map<size_t, tuple<char, int, int>> dirs{
{ 0, { 'U', 0, -1 } },
{ 1, { 'D', 0, 1 } },
{ 2, { 'L', -1, 0 } },
{ 3, { 'R', 1, 0 } }
};
auto is_open = [](auto chr) {
return strchr("bcdef", chr) != nullptr;
};
queue<pos_type> queue;
queue.emplace(0, 0, "");
while ( !queue.empty() ) {
auto [x, y, path] = queue.front();
queue.pop();
if ( x == 3 && y == 3 ) {
cout << path << '\n';
return;
}
auto hash = md5(passcode + path);
for ( size_t i = 0; i != 4; ++i ) {
if ( !is_open(hash.at(i)) ) {
continue;
}
auto [chr, dx, dy] = dirs.at(i);
auto new_x = x + dx;
auto new_y = y + dy;
if ( new_x < 0 || new_y < 0 || new_x >= 4 || new_y >= 4 ) {
continue;
}
queue.emplace(new_x, new_y, path + chr);
}
}
}
void
part2(const string& passcode)
{
static const map<size_t, tuple<char, int, int>> dirs{
{ 0, { 'U', 0, -1 } },
{ 1, { 'D', 0, 1 } },
{ 2, { 'L', -1, 0 } },
{ 3, { 'R', 1, 0 } }
};
auto is_open = [](auto chr) {
return strchr("bcdef", chr) != nullptr;
};
size_t max_length = 0;
queue<pos_type> queue;
queue.emplace(0, 0, "");
while ( !queue.empty() ) {
auto [x, y, path] = queue.front();
queue.pop();
if ( x == 3 && y == 3 ) {
max_length = max(max_length, path.size());
continue;
}
auto hash = md5(passcode + path);
for ( size_t i = 0; i != 4; ++i ) {
if ( !is_open(hash.at(i)) ) {
continue;
}
auto [chr, dx, dy] = dirs.at(i);
auto new_x = x + dx;
auto new_y = y + dy;
if ( new_x < 0 || new_y < 0 || new_x >= 4 || new_y >= 4 ) {
continue;
}
queue.emplace(new_x, new_y, path + chr);
}
}
cout << max_length << '\n';
}
} // namespace
int
main()
{
part1("awrkjxxr");
part2("awrkjxxr");
}
|