aboutsummaryrefslogtreecommitdiff
path: root/2022/src/day08.cpp
blob: b6cc3bfa3e1481e3cf81f4b62cef6a2b73f837f6 (plain)
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
#include <cstddef>
#include <fstream>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;

vector<string>
read_file(string_view filename)
{
	fstream        input{ filename };
	vector<string> data;

	for ( string line; getline(input, line); ) {
		data.emplace_back(line);
	}

	return data;
}

void
part1(const vector<string>& data)
{
	set<tuple<size_t, size_t>> positions;

	char max_so_far = 0;

	auto update = [&](size_t row, size_t col) {
		if ( data[row][col] > max_so_far ) {
			positions.emplace(row, col);
			max_so_far = data[row][col];
		}
	};

	for ( size_t row = 0; row != data.size(); ++row ) {
		max_so_far = 0;
		for ( size_t col = 0; col != data[row].size(); ++col ) {
			update(row, col);
		}

		max_so_far = 0;
		for ( size_t col = data[row].size(); col-- > 0; ) {
			update(row, col);
		}
	}

	for ( size_t col = 0; col != data[0].size(); ++col ) {
		max_so_far = 0;
		for ( size_t row = 0; row != data.size(); ++row ) {
			update(row, col);
		}

		max_so_far = 0;
		for ( size_t row = data.size(); row-- > 0; ) {
			update(row, col);
		}
	}

	cout << positions.size() << endl;
}

void
part2(const vector<string>& data)
{
	auto check = [&](size_t row, size_t col) -> size_t {
		size_t mul = 1;
		const tuple<size_t, size_t> directions[] = { { -1, 0 }, { 1, 0 }, { 0, -1 }, { 0, 1 } };
		for ( const auto& [dr, dc]: directions ) {
			size_t step = 1;
			for ( ;; ++step ) {
				const auto nrow = row + step * dr;
				const auto ncol = col + step * dc;

				if (nrow >= data.size() || ncol >= data[row].size()) {
					--step;
					break;
				}
				if (data[nrow][ncol] >= data[row][col]) {
					break;
				}
			}
			mul *= step;
		}
		return mul;
	};

	size_t max_so_far = 0;
	for ( size_t row = 0; row != data.size(); ++row ) {
		for ( size_t col = 0; col != data[row].size(); ++col ) {
			max_so_far = max(max_so_far, check(row, col));
		}
	}
	cout << max_so_far << endl;
}

int
main()
{
	const auto grid = read_file("data/day08.txt");
	part1(grid);
	part2(grid);
}