// Solutions to the Advent Of Code 2024.
// Copyright (C) 2025  Stefan Müller
//
// This program is free software: you can redistribute it and/or modify it under
// the terms of the GNU General Public License as published by the Free Software
// Foundation, either version 3 of the License, or (at your option) any later
// version.
//
// This program is distributed in the hope that it will be useful, but WITHOUT
// ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
// FOR A PARTICULAR PURPOSE.  See the GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License along with
// this program.  If not, see <http://www.gnu.org/licenses/>.

#pragma once

#include <array>
#include <vector>

#include <aoc/framework/Solver-types.hpp>

class CodeChronicle
    : public Solver<int64_t, int64_t>
{
public:
    virtual const std::string getPuzzleName() const override;
    virtual const int getPuzzleDay() const override;
    virtual void processDataLine(const std::string& line) override;
    virtual void finish() override;
private:
    using Schematic = std::array<uint32_t, 5>;
    static constexpr char getFilledChar();
    static constexpr unsigned getSchematicHeight();
    bool isNewSchematic_{ true };
    bool isLock_{};
    Schematic* current_;
    std::vector<Schematic> locks_{};
    std::vector<Schematic> keys_{};
    void resetCurrentSchematic();
    void updateCurrentSchematic(const std::string& line);
    void finishCurrentSchematic();
    bool canFit(const Schematic& schematic1, const Schematic& schematic2);
};