Finished Day 8 part 1

Author: zarethrex

include/advent_of_code/day_7.hxx

@@ -12,6 +12,10 @@
 #include "spdlog/spdlog.h"
 
 namespace AdventOfCode24::Day7 {
-    long check_calibration_line(const std::string& line, bool include_concatenator, const char& delimiter=':');
-    std::vector<long> process_file(const std::filesystem::path& input_file, bool include_concatenator);
+    int64_t check_calibration_line(
+        const std::string& line,
+        bool include_concatenator,
+        const char& delimiter = ':'
+    );
+    std::vector<int64_t> process_file(const std::filesystem::path& input_file, bool include_concatenator);
 };

include/advent_of_code/day_8.hxx

@@ -0,0 +1,40 @@
+#pragma once
+
+#include <fstream>
+#include <unordered_map>
+#include <unordered_set>
+#include <filesystem>
+#include <algorithm>
+#include <sstream>
+#include <string>
+#include <functional>
+#include <iostream>
+
+#include "spdlog/spdlog.h"
+
+typedef std::pair<int,int> coord;
+
+// Need to create custom hashing for the std::pair
+template<>
+struct std::hash<coord> {
+    std::size_t operator()(const coord& c) const {
+        return std::hash<int>()(c.first) ^ (std::hash<int>()(c.second) << 1);
+    }
+};
+
+namespace AdventOfCode24::Day8 {
+    typedef std::unordered_map<char, std::unordered_set<coord>> area_map;
+
+    class Map {
+        public:
+            area_map antennae;
+            std::unordered_set<coord> antinodes;
+            coord size;
+        Map(){};
+        Map(const Map& map) : antennae(map.antennae), antinodes(map.antinodes), size(map.size) {}
+    };
+
+    Map get_communication_network(const std::filesystem::path& input_file);
+    void calculate_antinode_positions(Map& communication_network, bool resonant_harmonics);
+    void print_map(const Map& communication_network);
+};

solutions/data/day_8.txt

@@ -0,0 +1,50 @@
+...............e.........................i........
+...............................1.......i.0........
+..............................s.0......d..........
+........................i....B.I............d.....
+.............................s....................
+................J.................................
+.....................L.....0i.......4...d.........
+.N...e...........................s..R.....4.....I.
+........e.........v................1......R....I..
+.............G..............0.....1...............
+..2...N.............B......................4...R..
+..............2...................N..........4s...
+..p...................................1..b..I.....
+..................p...........B........b...R......
+....................................b.............
+........W.......C.....w...........................
+............7....u.............B..................
+...W.................u......................bw....
+.......p.2...........v......................9.....
+.E.....C....u................................9....
+E....Y................u.D........9...........J....
+.......2..........................................
+............................J.................c...
+.............7...K..D..............J..............
+.....C.Wq........t.................T..............
+............Yt......v.............................
+..W......................3...............w........
+..7.....j................T...D.....n......8.....c.
+.........E...............nTD......................
+...r....E..........Y............n.......P........c
+......K........G......L...........................
+......................G.....L....v................
+..............G...t......q.............l.8........
+......................q............l..............
+...6........r.............................w..c....
+..6.........3.......Qk........T...................
+......Y...............j.................n.........
+..K.....S.....r......j.....U......9.l......8......
+........................U......................P..
+.....................q............................
+.......K......5..N.....j.7.Q......................
+...................p..k...U..........L.Q..........
+.r......3...S.......k........y....8U....Q.......P.
+.......S....g..3..................................
+.....S..........gk................................
+................5...................yP............
+.......................g......yV..l...............
+.........6.5...............V......................
+..................6..5..V.........................
+.............g.......................y..........V.

solutions/day_7.cxx

@@ -22,10 +22,10 @@ int main(int argc, char** argv) {
         throw std::runtime_error("File " + input_file.string() + " does not exist!");
     }
 
-    const std::vector<long> calibration_results{process_file(input_file, false)};
-    const std::vector<long> calibration_results_w_concat{process_file(input_file, true)};
-    const long total = std::accumulate(calibration_results.begin(), calibration_results.end(), 0L);
-    const long total_w_cat = std::accumulate(calibration_results_w_concat.begin(), calibration_results_w_concat.end(), 0L);
+    const std::vector<int64_t> calibration_results{process_file(input_file, false)};
+    const std::vector<int64_t> calibration_results_w_concat{process_file(input_file, true)};
+    const int64_t total = std::accumulate(calibration_results.begin(), calibration_results.end(), 0L);
+    const int64_t total_w_cat = std::accumulate(calibration_results_w_concat.begin(), calibration_results_w_concat.end(), 0L);
 
     spdlog::info("For file '" + input_file.string() + "' the total of successful calibration lines is " + std::to_string(total));
     spdlog::info("With concatenation operator '||' included, the total becomes: " + std::to_string(total_w_cat));

solutions/day_8.cxx

@@ -0,0 +1,37 @@
+#include <filesystem>
+#include <iostream>
+#include <numeric>
+#include <string>
+#include <set>
+#include "spdlog/spdlog.h"
+
+#include "advent_of_code/day_8.hxx"
+
+using namespace AdventOfCode24::Day8;
+
+int main(int argc, char** argv) {
+    if(argc != 2) {
+        spdlog::error("Expected input data file!");
+        return 1;
+    }
+
+    spdlog::set_level(spdlog::level::info);
+
+    const std::filesystem::path input_file{argv[1]};
+    if(!std::filesystem::exists(input_file)) {
+        throw std::runtime_error("File " + input_file.string() + " does not exist!");
+    }
+
+    Map communication_network{get_communication_network(input_file)};
+    Map communication_network_w_resonance{communication_network};
+    calculate_antinode_positions(communication_network, false);
+    calculate_antinode_positions(communication_network_w_resonance, true);
+
+    const size_t total_antinodes{communication_network.antinodes.size()};
+    print_map(communication_network);
+    spdlog::info("For file '" + input_file.string() + "' the total number of antinodes is " + std::to_string(total_antinodes));
+
+    const size_t total_antinodes_w_resonance{communication_network_w_resonance.antinodes.size()};
+    print_map(communication_network_w_resonance);
+    spdlog::info("Taking into account resonant harmonics this is " + std::to_string(total_antinodes_w_resonance));
+}

src/day_7.cxx

@@ -6,7 +6,7 @@
 #include <string>
 
 namespace AdventOfCode24::Day7 {
-    long check_calibration_line(const std::string& line, bool include_concatenator, const char& delimiter) {
+    int64_t check_calibration_line(const std::string& line, bool include_concatenator, const char& delimiter) {
         auto divider_find = std::find(line.begin(), line.end(), delimiter);
 
         if(divider_find == line.end()) {
@@ -20,47 +20,47 @@ namespace AdventOfCode24::Day7 {
             throw std::runtime_error("Target string is empty for line: " + line);
         }
 
-        long target{-1};
+        int64_t target{-1};
 
         try {
             target = std::stol(target_str);
         } catch(std::exception& e) {
-            throw std::runtime_error("Could not convert '" + target_str + "' to long integer.");
+            throw std::runtime_error("Could not convert '" + target_str + "' to int64_t integer.");
         }
 
         if(target < 0) {
-            throw std::runtime_error(target_str + " exceeds limit of long integer.");
+            throw std::runtime_error(target_str + " exceeds limit of int64_t integer.");
         }
 
         std::istringstream iss;
         iss.str(operands);
-        long number{-1};
+        int64_t number{-1};
         int n_numbers{0};
-        std::vector<long> operations{0};
+        std::vector<int64_t> operations{0};
 
         while(iss >> number) {
-            std::vector<long> results;
+            std::vector<int64_t> results;
 
             n_numbers++;
 
-            for(const long& n : operations) {
-                const long multiply{((n==0) ? 1 : n) * number};
-                const long add{n + number};
+            for(const int64_t& n : operations) {
+                const int64_t multiply{((n==0) ? 1 : n) * number};
+                const int64_t add{n + number};
 
                 if(multiply < 0) {
-                    throw std::runtime_error(std::to_string(multiply) + " exceeds limit of long integer.");
+                    throw std::runtime_error(std::to_string(multiply) + " exceeds limit of int64_t integer.");
                 }
 
                 if(add < 0) {
-                    throw std::runtime_error(std::to_string(add) + " exceeds limit of long integer.");
+                    throw std::runtime_error(std::to_string(add) + " exceeds limit of int64_t integer.");
                 }
 
                 if(multiply <= target) results.push_back(multiply);
                 if(add <= target) results.push_back(add);
 
                 if(include_concatenator) {
                     const std::string concatenate_str{std::to_string(n) + std::to_string(number)};
-                    const long concatenate{std::stol(concatenate_str)};
+                    const int64_t concatenate{std::stol(concatenate_str)};
                     if(concatenate <= target) results.push_back(concatenate);
                 }
             }
@@ -85,29 +85,28 @@ namespace AdventOfCode24::Day7 {
         if(max_loc == operations.end()) {
             spdlog::warn("Line failed, operation result below target value after processing.");
         } else {
-            const long max_reached{*max_loc};
+            const int64_t max_reached{*max_loc};
             spdlog::warn("Line failed, operation result below target value after processing " + std::to_string(n_numbers) + ": " + std::to_string(max_reached) + " < " + std::to_string(target));
         }
         return 0;
     }
 
-    std::vector<long> process_file(const std::filesystem::path& input_file, bool include_concatenator) {
+    std::vector<int64_t> process_file(const std::filesystem::path& input_file, bool include_concatenator) {
         std::ifstream read_in(input_file, std::ios::in);
 		std::string line;
-        std::vector<long> calibration_results;
+        std::vector<int64_t> calibration_results;
         int n_lines{0};
 
         while (std::getline(read_in, line)) {
             if(line.empty()) continue;
 
-            const long calibration{check_calibration_line(line, include_concatenator)};
+            const int64_t calibration{check_calibration_line(line, include_concatenator)};
 
             if(calibration < 0) {
                 throw std::runtime_error("Tried to append negative value " + std::to_string(calibration) + " to total!");
             }
 
             calibration_results.push_back(calibration);
-            std::cout << calibration << std::endl;
 
             n_lines++;
         }