Skip to content

Commit ad8c84f

Browse files
vss2snvss2sn
committed
Add 2022 day 11 cpp
1 parent 0b903c2 commit ad8c84f

File tree

5 files changed

+308
-2
lines changed

5 files changed

+308
-2
lines changed

‎2022/README.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -16,4 +16,5 @@ This folder contains solutions to each of the problems in Advent of Code 2022 in
1616
| <nobr> [Day 7: No Space Left On Device](https://adventofcode.com/2022/day/7) </nobr> | <nobr> [Part 1](/2022/cpp/day_07a.cpp) [Part 2](/2022/cpp/day_07b.cpp) </nobr> | </nobr> [Link](/2022/input/day_07_input) </nobr> | </nobr> [Link](/2022/sample_input/day_07_sample_input) </nobr> | </nobr> [Link](/2022/puzzles/day_07_puzzle) </nobr> |
1717
| <nobr> [Day 8: Treetop Tree House](https://adventofcode.com/2022/day/8) </nobr> | <nobr> [Part 1](/2022/cpp/day_08a.cpp) [Part 2](/2022/cpp/day_08b.cpp) </nobr> | </nobr> [Link](/2022/input/day_08_input) </nobr> | </nobr> [Link](/2022/sample_input/day_08_sample_input) </nobr> | </nobr> [Link](/2022/puzzles/day_08_puzzle) </nobr> |
1818
| <nobr> [Day 9: Rope Bridge](https://adventofcode.com/2022/day/9) </nobr> | <nobr> [Part 1](/2022/cpp/day_09a.cpp) [Part 2](/2022/cpp/day_09b.cpp) </nobr> | </nobr> [Link](/2022/input/day_09_input) </nobr> | </nobr> [Link](/2022/sample_input/day_09_sample_input) </nobr> | </nobr> [Link](/2022/puzzles/day_09_puzzle) </nobr> |
19-
| <nobr> [Day 10: Cathode-Ray Tube](https://adventofcode.com/2022/day/10) </nobr> | <nobr> [Part 1](/2022/cpp/day_10a.cpp) [Part 2](/2022/cpp/day_10b.cpp) </nobr> | </nobr> [Link](/2022/input/day_10_input) </nobr> | </nobr> [Link](/2022/sample_input/day_10_sample_input) </nobr> | </nobr> [Link](/2022/puzzles/day_10_puzzle) </nobr> |
19+
| <nobr> [Day 10: Cathode-Ray Tube](https://adventofcode.com/2022/day/10) </nobr> | <nobr> [Part 1](/2022/cpp/day_10a.cpp) [Part 2](/2022/cpp/day_10b.cpp) </nobr> | </nobr> [Link](/2022/input/day_10_input) </nobr> | </nobr> [Link](/2022/sample_input/day_10_sample_input) </nobr> | </nobr> [Link](/2022/puzzles/day_10_puzzle) </nobr> |
20+
| <nobr> [Day 11: Monkey in the Middle](https://adventofcode.com/2022/day/11) </nobr> | <nobr> [Part 1](/2022/cpp/day_11a.cpp) [Part 2](/2022/cpp/day_11b.cpp) </nobr> | </nobr> [Link](/2022/input/day_11_input) </nobr> | </nobr> [Link](/2022/sample_input/day_11_sample_input) </nobr> | </nobr> [Link](/2022/puzzles/day_11_puzzle) </nobr> |

‎2022/cpp/day_11a.cpp

+135
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,135 @@
1+
#include <algorithm>
2+
#include <fstream>
3+
#include <functional>
4+
#include <iostream>
5+
#include <queue>
6+
#include <string>
7+
#include <vector>
8+
9+
std::tuple<int, int> monkey_behaviour_model(const int old_level, const int to_multiply, const int to_add, const int to_divide, const int m1, const int m2) {
10+
const auto new_level = (old_level * to_multiply + to_add) / 3;
11+
return {new_level, new_level % to_divide == 0 ? m1 : m2 };
12+
}
13+
14+
struct Monkey {
15+
Monkey(const int id, const std::queue<int>& item_worry_levels, const std::function<std::tuple<int, int>(int)>& action)
16+
: id(id), item_worry_levels(item_worry_levels), action(action) {}
17+
18+
int id;
19+
int count = 0;
20+
std::queue<int> item_worry_levels;
21+
std::function<std::tuple<int, int>(int)> action;
22+
23+
void print() {
24+
std::cout << "Monkey " << id << ": ";
25+
const auto s = item_worry_levels.size();
26+
for (int i = 0; i < s; i++) {
27+
const auto ele = item_worry_levels.front();
28+
item_worry_levels.pop();
29+
std::cout << ele << ' ';
30+
item_worry_levels.push(ele);
31+
}
32+
std::cout << '\n';
33+
}
34+
};
35+
36+
std::function<std::tuple<int, int>(int)> get_monkey_behaviour(const std::vector<std::string>& args) {
37+
if (args[0] == "" && args[1] == "old") {
38+
return std::bind(monkey_behaviour_model, std::placeholders::_1, 1, std::placeholders::_1, std::stoi(args[2]), std::stoi(args[3]), std::stoi(args[4]));
39+
}
40+
else if (args[0] == "old" && args[1] == "") {
41+
return std::bind(monkey_behaviour_model, std::placeholders::_1, std::placeholders::_1, 0, std::stoi(args[2]), std::stoi(args[3]), std::stoi(args[4]));
42+
}
43+
else if (args[0] == "") {
44+
return std::bind(monkey_behaviour_model, std::placeholders::_1, 1, std::stoi(args[1]), std::stoi(args[2]), std::stoi(args[3]), std::stoi(args[4]));
45+
}
46+
else if (args[1] == "") {
47+
return std::bind(monkey_behaviour_model, std::placeholders::_1, std::stoi(args[0]), 0, std::stoi(args[2]), std::stoi(args[3]), std::stoi(args[4]));
48+
}
49+
else {
50+
std::cout << "This should not happen" << '\n';
51+
exit(0);
52+
}
53+
}
54+
55+
// Assumes queue has at least 1 item; can be esily modified to generalize
56+
std::queue<int> parse_starting_items(const std::string& line) {
57+
std::queue<int> q;
58+
size_t start = 17;
59+
size_t end = line.find(", ", start);
60+
while (end != std::string::npos) {
61+
q.push(std::stoi(line.substr(start, end - start)));
62+
start = end + 2;
63+
end = line.find(", ", start);
64+
}
65+
q.push(std::stoi(line.substr(start, line.size() - start)));
66+
return q;
67+
}
68+
69+
int main(int argc, char * argv[]) {
70+
std::string input = "../input/day_11_input";
71+
if (argc > 1) {
72+
input = argv[1];
73+
}
74+
75+
std::string line;
76+
std::fstream file(input);
77+
78+
std::vector<Monkey> monkeys;
79+
80+
while(std::getline(file, line)) { // Get monkey id
81+
const int id = std::stoi(line.substr(7, line.size() - 7));
82+
std::getline(file, line);
83+
std::queue<int> item_worry_levels = parse_starting_items(line);
84+
85+
std::vector<std::string> args;
86+
// Args consists of the following values:
87+
// to_multiply, to_add, to_divide, monkey id if test() is true, monkey id if test() is false
88+
89+
std::getline(file, line); // Get sign & value used in operation
90+
if (line[23] == '+') {
91+
args.emplace_back();
92+
args.push_back(line.substr(25, line.size() - 25));
93+
}
94+
else if (line[23] == '*') {
95+
args.push_back(line.substr(25, line.size() - 25));
96+
args.emplace_back();
97+
} else {
98+
std::cout << "This should not happen" << '\n';
99+
exit(0);
100+
}
101+
std::getline(file, line); // Get value used in test
102+
args.push_back(line.substr(21, line.size() - 21));
103+
std::getline(file, line); // Get id of monkey when test is true
104+
args.push_back(line.substr(29, line.size() - 29));
105+
std::getline(file, line); // Get id of monkey when test is false
106+
args.push_back(line.substr(30, line.size() - 30));
107+
108+
monkeys.emplace_back(id, item_worry_levels, get_monkey_behaviour(args));
109+
std::getline(file, line); // Get empty line separating monkeys
110+
}
111+
112+
// Assumes monkey id and monkey index is the same; can be esily modified to generalize
113+
constexpr int n_rounds = 20;
114+
for (int round = 0; round < n_rounds; round++) {
115+
for (int monkey_index = 0; monkey_index < monkeys.size(); monkey_index++) {
116+
while (!monkeys[monkey_index].item_worry_levels.empty()) {
117+
monkeys[monkey_index].count++;
118+
const auto worry = monkeys[monkey_index].item_worry_levels.front();
119+
monkeys[monkey_index].item_worry_levels.pop();
120+
const auto [new_worry, new_monkey_index] = monkeys[monkey_index].action(worry);
121+
// std::cout << "Moving " << worry << " from " << monkey_index << " as " << new_worry << " to " << new_monkey_index << '\n';
122+
monkeys[new_monkey_index].item_worry_levels.push(new_worry);
123+
}
124+
}
125+
}
126+
127+
// for (auto& monkey : monkeys) {
128+
// monkey.print()
129+
// }
130+
131+
std::nth_element(std::begin(monkeys), std::next(std::begin(monkeys), 2), std::end(monkeys), [](const auto& m1, const auto& m2) {return m1.count > m2.count;});
132+
std::cout << monkeys[0].count * monkeys[1].count << '\n';
133+
134+
return 0;
135+
}

‎2022/cpp/day_11b.cpp

+143
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,143 @@
1+
#include <algorithm>
2+
#include <fstream>
3+
#include <functional>
4+
#include <iostream>
5+
#include <queue>
6+
#include <string>
7+
#include <vector>
8+
9+
std::tuple<long long, long long> monkey_behaviour_model(const long long& old_level, const long long& rationalizer, const long long& to_multiply, const long long& to_add, const long long& to_divide, const long long& m1, const long long& m2) {
10+
const auto new_level = (old_level * to_multiply + to_add) % rationalizer;
11+
return {new_level, new_level % to_divide == 0 ? m1 : m2 };
12+
}
13+
14+
struct Monkey {
15+
Monkey(const long long& id, const std::queue<long long>& item_worry_levels, const std::function<std::tuple<long long, long long>(long long, long long)>& action)
16+
: id(id), item_worry_levels(item_worry_levels), action(action) {}
17+
18+
long long id;
19+
long long count = 0;
20+
std::queue<long long> item_worry_levels;
21+
std::function<std::tuple<long long, long long>(long long, long long)> action;
22+
23+
void print() {
24+
std::cout << "Monkey " << id << ": ";
25+
const auto s = item_worry_levels.size();
26+
for (long long i = 0; i < s; i++) {
27+
const auto ele = item_worry_levels.front();
28+
item_worry_levels.pop();
29+
std::cout << ele << ' ';
30+
item_worry_levels.push(ele);
31+
}
32+
std::cout << '\n';
33+
}
34+
};
35+
36+
std::function<std::tuple<long long, long long>(long long, long long)> get_monkey_behaviour(const std::vector<std::string>& args) {
37+
// Args consists of the following values:
38+
// to_multiply, to_add, to_divide, monkey id if test() is true, monkey id if test() is false
39+
if (args[0] == "" && args[1] == "old") {
40+
return std::bind(monkey_behaviour_model, std::placeholders::_1, std::placeholders::_2, 1, std::placeholders::_1, std::stoll(args[2]), std::stoll(args[3]), std::stoll(args[4]));
41+
}
42+
else if (args[0] == "old" && args[1] == "") {
43+
return std::bind(monkey_behaviour_model, std::placeholders::_1, std::placeholders::_2, std::placeholders::_1, 0, std::stoll(args[2]), std::stoll(args[3]), std::stoll(args[4]));
44+
}
45+
else if (args[0] == "") {
46+
return std::bind(monkey_behaviour_model, std::placeholders::_1, std::placeholders::_2, 1, std::stoll(args[1]), std::stoll(args[2]), std::stoll(args[3]), std::stoll(args[4]));
47+
}
48+
else if (args[1] == "") {
49+
return std::bind(monkey_behaviour_model, std::placeholders::_1, std::placeholders::_2, std::stoll(args[0]), 0, std::stoll(args[2]), std::stoll(args[3]), std::stoll(args[4]));
50+
}
51+
else {
52+
std::cout << "This should not happen" << '\n';
53+
exit(0);
54+
}
55+
}
56+
57+
// Assumes queue has at least 1 item; can be esily modified to generalize
58+
std::queue<long long> parse_starting_items(const std::string& line) {
59+
std::queue<long long> q;
60+
size_t start = 17;
61+
size_t end = line.find(", ", start);
62+
while (end != std::string::npos) {
63+
q.push(std::stoll(line.substr(start, end - start)));
64+
start = end + 2;
65+
end = line.find(", ", start);
66+
}
67+
q.push(std::stoll(line.substr(start, line.size() - start)));
68+
return q;
69+
}
70+
71+
int main(int argc, char * argv[]) {
72+
std::string input = "../input/day_11_input";
73+
if (argc > 1) {
74+
input = argv[1];
75+
}
76+
77+
std::string line;
78+
std::fstream file(input);
79+
80+
std::vector<Monkey> monkeys;
81+
82+
long long rationalizer = 1;
83+
while(std::getline(file, line)) {
84+
const long long id = std::stoll(line.substr(7, line.size() - 7));
85+
std::getline(file, line);
86+
std::queue<long long> item_worry_levels = parse_starting_items(line);
87+
88+
std::vector<std::string> args;
89+
// Args consists of the following values:
90+
// to_multiply, to_add, to_divide, monkey id if test() is true, monkey id if test() is false
91+
92+
std::getline(file, line); // Get sign & value used in operation
93+
if (line[23] == '+') {
94+
args.emplace_back();
95+
args.push_back(line.substr(25, line.size() - 25));
96+
}
97+
else if (line[23] == '*') {
98+
args.push_back(line.substr(25, line.size() - 25));
99+
args.emplace_back();
100+
} else {
101+
std::cout << "This should not happen" << '\n';
102+
exit(0);
103+
}
104+
std::getline(file, line); // Get value used in test
105+
const auto val_used_in_test_s = line.substr(21, line.size() - 21);
106+
args.push_back(val_used_in_test_s);
107+
const auto val_used_in_test_ll = std::stoll(val_used_in_test_s);
108+
if (rationalizer % val_used_in_test_ll != 0) {
109+
rationalizer *= val_used_in_test_ll;
110+
}
111+
std::getline(file, line); // Get id of monkey when test is true
112+
args.push_back(line.substr(29, line.size() - 29));
113+
std::getline(file, line); // Get id of monkey when test is false
114+
args.push_back(line.substr(30, line.size() - 30));
115+
116+
monkeys.emplace_back(id, item_worry_levels, get_monkey_behaviour(args));
117+
std::getline(file, line);
118+
}
119+
120+
// Assumes monkey id and monkey index is the same; can be esily modified to generalize
121+
constexpr long long n_rounds = 10000;
122+
for (long long round = 0; round < n_rounds; round++) {
123+
for (long long monkey_index = 0; monkey_index < monkeys.size(); monkey_index++) {
124+
while (!monkeys[monkey_index].item_worry_levels.empty()) {
125+
monkeys[monkey_index].count++;
126+
const auto worry = monkeys[monkey_index].item_worry_levels.front();
127+
monkeys[monkey_index].item_worry_levels.pop();
128+
const auto [new_worry, new_monkey_index] = monkeys[monkey_index].action(worry, rationalizer);
129+
// std::cout << "Moving " << worry << " from " << monkey << " as " << new_worry << " to " << new_monkey << '\n';
130+
monkeys[new_monkey_index].item_worry_levels.push(new_worry);
131+
}
132+
}
133+
}
134+
135+
// for (auto& monkey : monkeys) {
136+
// monkey.print();
137+
// }
138+
139+
std::nth_element(std::begin(monkeys), std::next(std::begin(monkeys), 2), std::end(monkeys), [](const auto& m1, const auto& m2) {return m1.count > m2.count;});
140+
std::cout << monkeys[0].count * monkeys[1].count << '\n';
141+
// std::cout << rationalizer << '\n';
142+
return 0;
143+
}

‎2022/sample_input/day_11_sample_input

+27
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,27 @@
1+
Monkey 0:
2+
Starting items: 79, 98
3+
Operation: new = old * 19
4+
Test: divisible by 23
5+
If true: throw to monkey 2
6+
If false: throw to monkey 3
7+
8+
Monkey 1:
9+
Starting items: 54, 65, 75, 74
10+
Operation: new = old + 6
11+
Test: divisible by 19
12+
If true: throw to monkey 2
13+
If false: throw to monkey 0
14+
15+
Monkey 2:
16+
Starting items: 79, 60, 97
17+
Operation: new = old * old
18+
Test: divisible by 13
19+
If true: throw to monkey 1
20+
If false: throw to monkey 3
21+
22+
Monkey 3:
23+
Starting items: 74
24+
Operation: new = old + 3
25+
Test: divisible by 17
26+
If true: throw to monkey 0
27+
If false: throw to monkey 1

‎README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -6,7 +6,7 @@ This repository contains solutions to the Advent of Code puzzles.
66

77
| Year | C++ | Python | Link to folders | Link to README.md |
88
|:----:|:----:|:----:|:----:|:----:|
9-
|2022 |1-10 | - | [Link](/2022/) |[Link](/2022/README.md) |
9+
|2022 |1-11 | - | [Link](/2022/) |[Link](/2022/README.md) |
1010
|2021 |1-25 | - | [Link](/2021/) |[Link](/2021/README.md) |
1111
|2020 |1-25 |1-25 | [Link](/2020/) |[Link](/2020/README.md) |
1212
|2019 |1-25 |1-7 | [Link](/2019/) |[Link](/2019/README.md) |

0 commit comments

Comments
 (0)