-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathday7.cpp
More file actions
84 lines (73 loc) · 2.1 KB
/
day7.cpp
File metadata and controls
84 lines (73 loc) · 2.1 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
#include "day7.hpp"
#include "util.hpp"
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
namespace Day7 {
int solve_day7_pt1(vector<string> &input) {
int result = 0;
for (size_t row = 1; row < input.size(); row++) {
for (size_t column = 0; column < input[0].size(); column++) {
if ((row == 1) && (input[0][column] == 'S')) {
input[row][column] = '|';
continue;
}
if (input[row][column] == '^') {
if (input[row - 1][column] == '|') {
input[row][column - 1] = '|';
input[row][column + 1] = '|';
column++;
result++;
}
} else if ((input[row][column] == '.') &&
(input[row - 1][column] == '|')) {
input[row][column] = '|';
}
}
}
return result;
}
using Point = util::Point<size_t>;
using Memo = unordered_map<Point, uint64_t, util::PointHash>;
uint64_t count_ways_to(const vector<string> &input, const size_t row,
const size_t column, Memo &memo) {
const auto cache_key = Point(row, column);
if (memo.find(cache_key) != memo.end()) {
return memo[cache_key];
}
const char upper = input[row - 1][column];
if (upper == 'S') {
return 1;
}
uint64_t result = 0;
if ((column < (input[0].size() - 1)) && (input[row][column + 1] == '^')) {
result += count_ways_to(input, row, column + 1, memo);
}
if ((column > 0) && (input[row][column - 1] == '^')) {
result += count_ways_to(input, row, column - 1, memo);
}
if (upper == '|') {
result += count_ways_to(input, row - 1, column, memo);
}
memo[cache_key] = result;
return result;
}
uint64_t solve_day7_pt2(vector<string> &input) {
solve_day7_pt1(input);
for (const auto &line : input) {
cout << line << endl;
}
const size_t last_row = input.size() - 1;
uint64_t result = 0;
Memo memo;
for (size_t column = 0; column < input[0].size(); column++) {
if (input[last_row][column] == '|') {
result += count_ways_to(input, last_row, column, memo);
}
}
return result;
}
} // namespace Day7