Add solution for 2025 Day 3
This commit is contained in:
@@ -0,0 +1,4 @@
|
|||||||
|
987654321111111
|
||||||
|
811111111111119
|
||||||
|
234234234234278
|
||||||
|
818181911112111
|
||||||
+42
-13
@@ -2,35 +2,64 @@
|
|||||||
|
|
||||||
namespace y2025::day03
|
namespace y2025::day03
|
||||||
{
|
{
|
||||||
using InputType = std::vector<int>;
|
using InputType = std::vector<std::string>;
|
||||||
REGISTER_DAY(2025, Day03, InputType, int);
|
REGISTER_DAY(2025, Day03, InputType, int64_t);
|
||||||
|
|
||||||
REGISTER_TEST_EXAMPLE(2025, Day03, ExampleInput, 1, 0);
|
REGISTER_TEST_EXAMPLE(2025, Day03, ExampleInput, 1, 357);
|
||||||
REGISTER_TEST(2025, Day03, Input, 1, 0);
|
REGISTER_TEST(2025, Day03, Input, 1, 17430);
|
||||||
REGISTER_TEST_EXAMPLE(2025, Day03, ExampleInput, 2, 0);
|
REGISTER_TEST_EXAMPLE(2025, Day03, ExampleInput, 2, 3121910778619);
|
||||||
REGISTER_TEST(2025, Day03, Input, 2, 0);
|
REGISTER_TEST(2025, Day03, Input, 2, 171975854269367);
|
||||||
|
|
||||||
READ_INPUT(input)
|
READ_INPUT(input)
|
||||||
{
|
{
|
||||||
std::vector<int> vec;
|
std::vector<std::string> vec;
|
||||||
std::string str;
|
std::string str;
|
||||||
while (std::getline(input, str))
|
while (std::getline(input, str))
|
||||||
{
|
{
|
||||||
std::stringstream ss{str};
|
vec.emplace_back(str);
|
||||||
int n;
|
|
||||||
ss >> n;
|
|
||||||
vec.emplace_back(n);
|
|
||||||
}
|
}
|
||||||
return vec;
|
return vec;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template <size_t N>
|
||||||
|
int64_t Joltage(const std::vector<std::string>& input)
|
||||||
|
{
|
||||||
|
int64_t sum = 0;
|
||||||
|
|
||||||
|
for (const auto& line : input)
|
||||||
|
{
|
||||||
|
std::array<int, N> max{};
|
||||||
|
std::array<int, N + 1> index{};
|
||||||
|
for (int i = 0; i < max.size(); i++)
|
||||||
|
{
|
||||||
|
for (int j = index[i]; j <= line.size() - (max.size() - i); j++)
|
||||||
|
{
|
||||||
|
int num = line[j] - '0';
|
||||||
|
if (num > max[i])
|
||||||
|
{
|
||||||
|
max[i] = num;
|
||||||
|
index[i + 1] = j + 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
int64_t val = 0;
|
||||||
|
for (int i = 0; i < max.size(); i++)
|
||||||
|
{
|
||||||
|
val = val * 10 + max[i];
|
||||||
|
}
|
||||||
|
sum += val;
|
||||||
|
}
|
||||||
|
return sum;
|
||||||
|
}
|
||||||
|
|
||||||
OUTPUT1(input)
|
OUTPUT1(input)
|
||||||
{
|
{
|
||||||
return 0;
|
return Joltage<2>(input);
|
||||||
}
|
}
|
||||||
|
|
||||||
OUTPUT2(input)
|
OUTPUT2(input)
|
||||||
{
|
{
|
||||||
return 0;
|
return Joltage<12>(input);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|||||||
@@ -1,6 +1,7 @@
|
|||||||
#pragma once
|
#pragma once
|
||||||
|
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
|
#include <array>
|
||||||
#include <functional>
|
#include <functional>
|
||||||
#include <iostream>
|
#include <iostream>
|
||||||
#include <limits>
|
#include <limits>
|
||||||
@@ -685,6 +686,12 @@ static std::ostream& operator<<(std::ostream& stream, const std::set<T>& contain
|
|||||||
return Helper::Print(stream, container);
|
return Helper::Print(stream, container);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
template <typename T, size_t N>
|
||||||
|
static std::ostream& operator<<(std::ostream& stream, const std::array<T, N>& container)
|
||||||
|
{
|
||||||
|
return Helper::Print(stream, container);
|
||||||
|
}
|
||||||
|
|
||||||
template <typename T, typename S>
|
template <typename T, typename S>
|
||||||
static std::ostream& operator<<(std::ostream& stream, const std::map<T, S>& container)
|
static std::ostream& operator<<(std::ostream& stream, const std::map<T, S>& container)
|
||||||
{
|
{
|
||||||
|
|||||||
Reference in New Issue
Block a user