ollien/advent-of-code-2020
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Use reduce in day3

Browse source
This commit is contained in:
Nick Krichevsky 2020-12-03 00:24:50 -05:00
parent 02e256a6cd
commit ed1c1037af
1 changed files with 12 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
day3/day3.cpp
View file

@ -1,5 +1,7 @@
#include <execution>
#include <fstream> #include <fstream>
#include <iostream> #include <iostream>
#include <numeric>
#include <vector> #include <vector>
constexpr char TREE_CHAR = '#'; constexpr char TREE_CHAR = '#';
@ -39,13 +41,20 @@ int part1(const std::vector<std::string> &input) {
} }
long part2(const std::vector<std::string> &input) { long part2(const std::vector<std::string> &input) {
return 1L * findNumTrees(input, 1, 1) * findNumTrees(input, 3, 1) * findNumTrees(input, 5, 1) * // deltas in the x and y directions respectively
findNumTrees(input, 7, 1) * findNumTrees(input, 1, 2); std::vector<std::pair<int, int>> deltas{std::pair<int, int>(1, 1), std::pair<int, int>(3, 1),
std::pair<int, int>(5, 1), std::pair<int, int>(7, 1),
std::pair<int, int>(1, 2)};
return std::reduce(std::execution::par, deltas.begin(), deltas.end(), 1L,
[&](long total, std::pair<int, int> step_deltas) {
return total * findNumTrees(input, step_deltas.first, step_deltas.second);
});
} }
int main(int argc, char *argv[]) { int main(int argc, char *argv[]) {
if (argc != 2) { if (argc != 2) {
std::cerr << "./" << argv[0] << "<input_file>" << std::endl; std::cerr << argv[0] << "<input_file>" << std::endl;
return 1; return 1;
} }