-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
127 lines (121 loc) · 4.2 KB
/
main.cpp
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
#include "file.h"
#include <iostream>
#include <deque>
#include <map>
namespace aoc2017_day16 {
std::string part_1(std::string_view path, int size = 16) {
std::string input = file::readFileAsString(path);
std::deque<char> letters;
for (int i = 0; i < size; ++i) {
letters.push_back(i + 'a');
}
int i = 0;
while (i < input.size()) {
if (input[i] == 's') {
i++;
int nr = 0;
while (input[i] != ',') {
nr = nr * 10 + input[i] - '0';
i++;
}
i++;
for (int j = 0; j < nr; ++j) {
letters.push_front(letters.back());
letters.pop_back();
}
}
else if (input[i] == 'p') {
int nr1 = 0, nr2 = 0;
for (int j = 0; j < letters.size(); ++j) {
if (letters[j] == input[i + 1]) nr1 = j;
if (letters[j] == input[i + 3]) nr2 = j;
}
std::swap(letters[nr1], letters[nr2]);
i = i + 5;
}
else {
i++;
int nr1 = 0, nr2 = 0;
while (input[i] != '/') {
nr1 = nr1 * 10 + input[i] - '0';
i++;
}
i++;
while (i < input.size() && input[i] != ',') {
nr2 = nr2 * 10 + input[i] - '0';
i++;
}
i++;
std::swap(letters[nr1], letters[nr2]);
}
}
return std::string(letters.begin(), letters.end());
}
std::string part_2(std::string_view path, int size = 16) {
constexpr int ROUNDS = 1000000000;
std::map<std::string, int> rounds;
std::deque<char> letters;
std::string input = file::readFileAsString(path);
for (int i = 0; i < size; ++i) {
letters.push_back(i + 'a');
}
for (int k = 0; k < ROUNDS; ++k) {
int i = 0;
while (i < input.size()) {
if (input[i] == 's') {
i++;
int nr = 0;
while (input[i] != ',') {
nr = nr * 10 + input[i] - '0';
i++;
}
i++;
for (int j = 0; j < nr; ++j) {
letters.push_front(letters.back());
letters.pop_back();
}
} else if (input[i] == 'p') {
int nr1 = 0, nr2 = 0;
for (int j = 0; j < letters.size(); ++j) {
if (letters[j] == input[i + 1]) nr1 = j;
if (letters[j] == input[i + 3]) nr2 = j;
}
std::swap(letters[nr1], letters[nr2]);
i = i + 5;
} else {
i++;
int nr1 = 0, nr2 = 0;
while (input[i] != '/') {
nr1 = nr1 * 10 + input[i] - '0';
i++;
}
i++;
while (i < input.size() && input[i] != ',') {
nr2 = nr2 * 10 + input[i] - '0';
i++;
}
i++;
std::swap(letters[nr1], letters[nr2]);
}
}
auto el = rounds.find(std::string(letters.begin(), letters.end()));
if (el == rounds.end()) {
rounds.insert({std::string(letters.begin(), letters.end()), k});
}
else {
int interval = k - el->second;
while (k + interval < ROUNDS) {
k += interval;
}
}
}
return std::string(letters.begin(), letters.end());
}
}
#ifndef TESTING
int main() {
std::cout << "Part 1: " << aoc2017_day16::part_1("../2017/day16/input.in") << std::endl;
std::cout << "Part 2: " << aoc2017_day16::part_2("../2017/day16/input.in") << std::endl;
return 0;
}
#endif