aboutsummaryrefslogtreecommitdiff
path: root/2023/src/day11.cpp
blob: e1a0882572e639a23694f256fcf06d28c0f470f4 (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
#include <cmath>
#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;
}

vector<tuple<long, long>>
find_points(const vector<string>& input)
{
	vector<tuple<long, long>> result;

	for ( size_t row = 0; row != input.size(); ++row ) {
		const auto& line = input[row];

		for ( size_t col = 0; col != line.size(); ++col ) {
			if ( line[col] == '#' ) {
				result.emplace_back(long(row), long(col));
			}
		}
	}

	return result;
}

void
find_empty_rows_and_cols(const vector<string>& input, set<long>& cols, set<long>& rows)
{
	for ( size_t row = 0; row != input.size(); ++row ) {
		const auto& line = input[row];
		if ( line.find('#') == line.npos ) {
			rows.insert(long(row));
		}
	}

	for ( size_t col = 0; col != input[0].size(); ++col ) {
		bool empty_col = true;
		for ( const auto& line: input ) {
			if ( line[col] == '#' ) {
				empty_col = false;
			}
		}
		if ( empty_col ) {
			cols.insert(long(col));
		}
	}
}

long
solve(const vector<string>& input, long scale)
{
	auto points = find_points(input);

	set<long> cols;
	set<long> rows;

	find_empty_rows_and_cols(input, cols, rows);

	for ( auto& point: points ) {
		const auto row = get<0>(point) + count_if(rows.begin(), rows.end(), [&](long row) { return row < get<0>(point); }) * (scale - 1);
		const auto col = get<1>(point) + count_if(cols.begin(), cols.end(), [&](long col) { return col < get<1>(point); }) * (scale - 1);

		point = { row, col };
	}

	auto sum = 0L;
	for ( size_t i = 0; i != points.size(); ++i ) {
		for ( size_t j = i + 1; j != points.size(); ++j ) {
			const auto& from = points[i];
			const auto& to   = points[j];

			sum += abs(get<0>(from) - get<0>(to)) + abs(get<1>(from) - get<1>(to));
		}
	}

	return sum;
}

int
main()
{
	const auto input = read_file("data/day11.txt");

	cout << "Part1: " << solve(input, 2) << endl;
	cout << "Part2: " << solve(input, 1000000) << endl;
}