|
| 1 | +#include <iostream> |
| 2 | +#include <string> |
| 3 | +#include <unordered_set> |
| 4 | +#include <vector> |
| 5 | +#include "utils.h" |
| 6 | + |
| 7 | +class Container { |
| 8 | +public: |
| 9 | + std::vector<int> data; |
| 10 | + bool valid; |
| 11 | +}; |
| 12 | + |
| 13 | +Container trialRun(std::vector<int>& input, const std::unordered_map<int, std::vector<int>>& rules) { |
| 14 | + std::vector<int> passedItems; |
| 15 | + bool valid = true; |
| 16 | + for (int i = 0; i < input.size(); i++) { |
| 17 | + auto item = input[i]; |
| 18 | + if (rules.contains(item)) { |
| 19 | + std::vector<int> rulesForItem = rules.find(item)->second; |
| 20 | + for (auto& alreadyFoundItem : rulesForItem) { |
| 21 | + for (const auto& passedItem : passedItems) { |
| 22 | + if (passedItem == alreadyFoundItem) { |
| 23 | + valid = false; |
| 24 | + |
| 25 | + for (int j = 0; j <= i; j++) { |
| 26 | + if (input[j] == passedItem) { |
| 27 | + passedItems.insert(passedItems.begin() + j, item); |
| 28 | + break; |
| 29 | + } |
| 30 | + } |
| 31 | + for (int j = i+1; j < input.size(); j++) { |
| 32 | + passedItems.push_back(input[j]); |
| 33 | + } |
| 34 | + return Container(passedItems, valid); |
| 35 | + } |
| 36 | + } |
| 37 | + } |
| 38 | + } |
| 39 | + passedItems.push_back(item); |
| 40 | + } |
| 41 | + return Container(passedItems, valid); |
| 42 | +} |
| 43 | + |
| 44 | +int getAnswer(std::vector<std::vector<int>> input, const std::unordered_map<int, std::vector<int>>& rules, bool partA) { |
| 45 | + int sum = 0; |
| 46 | + |
| 47 | + for (auto& inputItem : input) { |
| 48 | + bool valid; |
| 49 | + do { |
| 50 | + auto result = trialRun(inputItem, rules); |
| 51 | + valid = result.valid; |
| 52 | + |
| 53 | + if (valid) { |
| 54 | + sum += result.data[result.data.size()/2]; |
| 55 | + } else { |
| 56 | + inputItem = result.data; |
| 57 | + } |
| 58 | + } while (!valid && !partA); |
| 59 | + } |
| 60 | + |
| 61 | + return sum; |
| 62 | +} |
| 63 | + |
| 64 | +int main() { |
| 65 | + const std::vector<std::string> lines = readFile("../input/input"); |
| 66 | + |
| 67 | + bool firstParse = true; |
| 68 | + std::vector<std::vector<int>> input; |
| 69 | + std::unordered_map<int, std::vector<int>> rules; |
| 70 | + std::vector<std::string> result; |
| 71 | + for (const auto& line : lines) { |
| 72 | + if (line.empty()) { |
| 73 | + firstParse = false; |
| 74 | + continue; |
| 75 | + } |
| 76 | + if (firstParse) { |
| 77 | + result = split(line, '|'); |
| 78 | + auto num = stoi(result[0]); |
| 79 | + if (rules.contains(num)) { |
| 80 | + rules.find(num)->second.push_back(stoi(result[1])); |
| 81 | + } else { |
| 82 | + rules.insert({num, {stoi(result[1])}}); |
| 83 | + } |
| 84 | + } else { |
| 85 | + result = split(line, ','); |
| 86 | + std::vector<int> inputItem; |
| 87 | + for (const auto& item : result) { |
| 88 | + inputItem.push_back(std::stoi(item)); |
| 89 | + } |
| 90 | + input.push_back(inputItem); |
| 91 | + } |
| 92 | + } |
| 93 | + |
| 94 | + int answer = getAnswer(input, rules, true); |
| 95 | + std::cout << "Part A: " << answer << std::endl; |
| 96 | + std::cout << "Part B: " << getAnswer(input, rules, false) - answer << std::endl; |
| 97 | + |
| 98 | + return 0; |
| 99 | +} |
0 commit comments