-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathday6.cpp
More file actions
88 lines (79 loc) · 2.31 KB
/
day6.cpp
File metadata and controls
88 lines (79 loc) · 2.31 KB
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
#include "day6.hpp"
#include "util.hpp"
#include <cassert>
#include <cstddef>
#include <cstdint>
#include <string>
#include <vector>
namespace Day6 {
uint64_t solve_day6_pt1(const vector<string> &input) {
vector<vector<string>> tokenized;
for (const string &line : input) {
vector<string> tokens = util::split_by_spaces(line);
tokenized.push_back(tokens);
};
uint64_t result = 0;
for (size_t i = 0; i < tokenized[0].size(); i++) {
const string operation = tokenized[tokenized.size() - 1][i];
uint64_t subresult = (operation == "+") ? 0 : 1;
for (size_t j = 0; j < tokenized.size() - 1; j++) {
const uint64_t num = stoi(tokenized[j][i]);
subresult = (operation == "+") ? (subresult + num) : (subresult * num);
}
result += subresult;
}
return result;
}
bool is_all_spaces(const vector<string> &input, const size_t column) {
assert((column < input[0].size()) && (column >= 0));
for (size_t i = 0; i < input.size(); i++) {
if (input[i][column] != ' ') {
return false;
}
}
return true;
}
int to_number(const vector<string> &input, const size_t column) {
string result = "";
for (size_t i = 0; i < input.size() - 1; i++) {
result += input[i][column];
}
return stoi(result);
}
uint64_t process(const vector<string> &input, int start, int end_exclusive) {
assert(start > end_exclusive);
vector<int> numbers;
char operation = ' ';
for (int i = start; i > end_exclusive; i--) {
numbers.push_back(to_number(input, i));
if (operation == ' ') {
const char possible_operation = input[input.size() - 1][i];
if (possible_operation != ' ') {
operation = possible_operation;
}
}
}
uint64_t result = (operation == '+') ? 0 : 1;
for (size_t i = 0; i < numbers.size(); i++) {
const int num = numbers[i];
result = (operation == '+') ? (result + num) : (result * num);
}
return result;
}
uint64_t solve_day6_pt2(const vector<string> &input) {
uint64_t result = 0;
int start = input[0].size() - 1;
int end_exclusive = start;
for (int i = start; i >= 0; i--) {
if (is_all_spaces(input, i)) {
end_exclusive = i;
result += process(input, start, end_exclusive);
i--;
start = i;
end_exclusive = start;
}
}
result += process(input, start, -1);
return result;
}
} // namespace Day6