aboutsummaryrefslogtreecommitdiff
path: root/2024/src/day06.cpp
blob: 1198d541154429663eb231a7c4b4a066780e0416 (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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
#include <fstream>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
using namespace std;

using pos_type = tuple<size_t, size_t>;

map<pos_type, char>
read_file(string_view filename)
{
	fstream             input{ filename };
	map<pos_type, char> data;

	size_t yPos = 0;
	for ( string line; getline(input, line); ) {
		for ( size_t xPos = 0; xPos != line.size(); ++xPos ) {
			data[{ xPos, yPos }] = line[xPos];
		}
		++yPos;
	}

	return data;
}

set<pos_type>
distinct_positions(const map<pos_type, char>& data)
{
	static const array<pos_type, 4> deltas = {
		make_tuple(0, -1),
		make_tuple(1, 0),
		make_tuple(0, 1),
		make_tuple(-1, 0)
	};

	size_t direction = 0;

	auto position = get<0>(*ranges::find_if(data, [](auto position) {
		return get<1>(position) == '^';
	}));

	set<pos_type> positions;
	while ( true ) {
		positions.emplace(position);

		auto next_position = make_tuple(get<0>(position) + get<0>(deltas.at(direction)),
		                                get<1>(position) + get<1>(deltas.at(direction)));

		if ( !data.contains(next_position) ) {
			break;
		}

		if ( data.at(next_position) == '#' ) {
			direction = (direction + 1) % deltas.size();
		}
		else {
			position = next_position;
		}
	}

	return positions;
}

void
part1(const map<pos_type, char>& data)
{
	auto positions = distinct_positions(data);

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

bool
would_loop(const map<pos_type, char>& data)
{
	static const array<pos_type, 4> deltas = {
		make_tuple(0, -1),
		make_tuple(1, 0),
		make_tuple(0, 1),
		make_tuple(-1, 0)
	};

	size_t direction = 0;

	auto position = get<0>(*ranges::find_if(data, [](auto position) {
		return get<1>(position) == '^';
	}));

	set<tuple<pos_type, size_t>> positions;

	while ( true ) {
		positions.emplace(position, direction);

		auto next_position = make_tuple(get<0>(position) + get<0>(deltas.at(direction)),
		                                get<1>(position) + get<1>(deltas.at(direction)));

		if ( !data.contains(next_position) ) {
			return false;
		}

		if ( data.at(next_position) == '#' ) {
			direction = (direction + 1) % deltas.size();
		}
		else {
			position = next_position;
		}

		if ( positions.contains({ position, direction }) ) {
			return true;
		}
	}
}

void
part2(map<pos_type, char> data)
{
	const auto positions = distinct_positions(data);

	long sum = 0;
	for ( const auto& position: positions ) {
		if ( data.at(position) == '.' ) {
			data.at(position) = '#';
			if ( would_loop(data) ) {
				++sum;
			}
			data.at(position) = '.';
		}
	}
	cout << sum << endl;
}

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