mgrettondann/advent-of-code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Tidy solution for 2022 day 15 part 2 x2.

Browse Source
This commit is contained in:
Matthew Gretton-Dann
2022-12-15 09:52:05 +00:00
parent ed02811d56
commit 3627718a3e
1 changed files with 5 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
2022/puzzle-15-02.cc
View File

@@ -7,8 +7,8 @@
#include <list> #include <list>
#include <numeric> #include <numeric>
#include <regex> #include <regex>
#include <set>
#include <utility> #include <utility>
#include <vector>
using Int = std::int64_t; using Int = std::int64_t;
using UInt = std::uint64_t; using UInt = std::uint64_t;
@@ -49,7 +49,8 @@ auto main() -> int
} }
for (Int row{0}; row < max_row; ++row) { for (Int row{0}; row < max_row; ++row) {
std::set<Range, RangeCompare> ranges; std::vector<Range> ranges;
ranges.reserve(sensors.size());
for (auto const& sensor : sensors) { for (auto const& sensor : sensors) {
Int const sx{sensor.first.first}; Int const sx{sensor.first.first};
@@ -65,9 +66,10 @@ auto main() -> int
if (row_dist <= dist) { if (row_dist <= dist) {
Int const x_dist{dist - row_dist}; Int const x_dist{dist - row_dist};
Range const missing{sx - x_dist, sx + x_dist + 1}; Range const missing{sx - x_dist, sx + x_dist + 1};
ranges.insert(missing); ranges.emplace_back(missing);
} }
} }
std::sort(ranges.begin(), ranges.end(), RangeCompare{});
Int last_pos{0}; Int last_pos{0};
for (auto const& r : ranges) { for (auto const& r : ranges) {