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

Reformat day 3

Browse source
This commit is contained in:
Nick Krichevsky 2020-12-03 00:32:02 -05:00
parent ed1c1037af
commit 5b41f34883
1 changed files with 11 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

18
day3/day3.cpp
View file

@ -42,14 +42,18 @@ int part1(const std::vector<std::string> &input) {
long part2(const std::vector<std::string> &input) { long part2(const std::vector<std::string> &input) {
// deltas in the x and y directions respectively // deltas in the x and y directions respectively
std::vector<std::pair<int, int>> deltas{std::pair<int, int>(1, 1), std::pair<int, int>(3, 1), std::vector<std::pair<int, int>> deltas{
std::pair<int, int>(5, 1), std::pair<int, int>(7, 1), std::pair<int, int>(1, 1),
std::pair<int, int>(1, 2)}; 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, return std::reduce(
[&](long total, std::pair<int, int> step_deltas) { 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); return total * findNumTrees(input, step_deltas.first, step_deltas.second);
}); });
} }
int main(int argc, char *argv[]) { int main(int argc, char *argv[]) {