#include <array>
#include <cassert>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <regex>
#include <set>
#include <string>

#include "graph-utils.h"

// Map:
// #############
// #ab.c.d.e.fg#
// ###h#i#j#k###
//   #l#m#n#o#
//   #########
//
//  0 -1- 1 -2- 2 -2- 3 -2- 4 -2- 5 -1- 6
//         \   / \   / \   / \   /
//          2 2   2 2   2 2   2 2
//           +     +     +     +
//           7     8     9    10
//           |     |     |     |
//           1     1     1     1
//           |     |     |     |
//          11    12    13    14
// Actually : {0-6} can go to any of {7-10} at varying cost but there are move restritions.

using Position = char;
using UInt = int;
using Type = char;

std::multimap<Position, std::pair<Position, UInt>> valid_moves{
  {0, {7, 3}},  {0, {8, 5}},  {0, {9, 7}},  {0, {10, 9}},  {1, {7, 2}},  {1, {8, 4}},  {1, {9, 6}},
  {1, {10, 8}}, {2, {7, 2}},  {2, {8, 2}},  {2, {9, 4}},   {2, {10, 6}}, {3, {7, 4}},  {3, {8, 2}},
  {3, {9, 2}},  {3, {10, 4}}, {4, {7, 6}},  {4, {8, 4}},   {4, {9, 2}},  {4, {10, 2}}, {5, {7, 8}},
  {5, {8, 6}},  {5, {9, 4}},  {5, {10, 2}}, {6, {7, 9}},   {6, {8, 7}},  {6, {9, 5}},  {6, {10, 3}},
  {7, {0, 3}},  {7, {1, 2}},  {7, {2, 2}},  {7, {3, 4}},   {7, {4, 6}},  {7, {5, 8}},  {7, {6, 9}},
  {7, {11, 1}}, {8, {0, 5}},  {8, {1, 4}},  {8, {2, 2}},   {8, {3, 2}},  {8, {4, 4}},  {8, {5, 6}},
  {8, {6, 7}},  {8, {12, 1}}, {9, {0, 7}},  {9, {1, 6}},   {9, {2, 4}},  {9, {3, 2}},  {9, {4, 2}},
  {9, {5, 4}},  {9, {6, 5}},  {9, {13, 1}}, {10, {0, 9}},  {10, {1, 8}}, {10, {2, 6}}, {10, {3, 4}},
  {10, {4, 2}}, {10, {5, 2}}, {10, {6, 3}}, {10, {14, 1}}, {11, {7, 1}}, {12, {8, 1}}, {13, {9, 1}},
  {14, {10, 1}}};

std::map<Type, UInt> multipliers{{'A', 1}, {'B', 10}, {'C', 100}, {'D', 1000}};

struct State
{
  auto finished() const noexcept -> bool { return nodes_ == finished_; }
  auto size() const noexcept -> UInt { return 15; }
  auto node(unsigned idx) noexcept -> Type& { return nodes_[idx]; }
  auto node(unsigned idx) const noexcept -> Type const& { return nodes_[idx]; }
  auto cost() const noexcept -> UInt { return cost_; }

  bool check_move(unsigned from, unsigned to)
  {
    if (from < 7) {
      assert(to > 6 && to < 11);
    }
    else if (from > 6 & from < 11) {
      assert(to < 7 || (to > 10 && to < 15));
    }
    else if (from > 10 && from < 15) {
      assert(to > 6 && to < 11);
    }
    else {
      assert(false);
    }
    if (nodes_[from] == '.' || nodes_[to] != '.') {
      return false;
    }
    if (from > 10) {
      // Only move out of the bottom row if we're not meant to be here.
      return nodes_[from] != finished_[from];
    }
    if (from > 6 && from < 11) {
      if (to > 10) {
        // Only move into bottom position if we're moving the correct piece.
        return nodes_[from] == finished_[to];
      }
      // Moving to top row
      if (to == 0 && nodes_[1] != '.') {
        return false;
      }
      if (to < 2 && from > 7 && nodes_[2] != '.') {
        return false;
      }
      if (to < 3 && from > 8 && nodes_[3] != '.') {
        return false;
      }
      if (to < 4 && from > 9 && nodes_[4] != '.') {
        return false;
      }

      if (to == 6 && nodes_[5] != '.') {
        return false;
      }
      if (to > 4 && from < 10 && nodes_[4] != '.') {
        return false;
      }
      if (to > 3 && from < 9 && nodes_[3] != '.') {
        return false;
      }
      if (to > 2 && from < 8 && nodes_[2] != '.') {
        return false;
      }

      return true;
    }
    if (from < 7) {
      // Can only move down if we're the right type.
      if (nodes_[from] != finished_[to]) {
        return false;
      }

      // Now encode the rules about moving along the top.
      if (from == 0 && nodes_[1] != '.') {
        return false;
      }
      if (from < 2 && to > 7 && nodes_[2] != '.') {
        return false;
      }
      if (from < 3 && to > 8 && nodes_[3] != '.') {
        return false;
      }
      if (from < 4 && to > 9 && nodes_[4] != '.') {
        return false;
      }

      if (from == 6 && nodes_[5] != '.') {
        return false;
      }
      if (from > 4 && to < 10 && nodes_[4] != '.') {
        return false;
      }
      if (from > 3 && to < 9 && nodes_[3] != '.') {
        return false;
      }
      if (from > 2 && to < 8 && nodes_[2] != '.') {
        return false;
      }

      return true;
    }
    abort();
  }

  bool move(unsigned from, unsigned to, UInt cost)
  {
    if (!check_move(from, to)) {
      return false;
    }
    std::swap(nodes_[from], nodes_[to]);
    cost_ += cost;
    return true;
  }

  bool operator<(State const& rhs) const noexcept { return nodes_ < rhs.nodes_; }
  bool operator==(State const& rhs) const noexcept { return nodes_ < rhs.nodes_; }

private:
  std::array<Type, 15> nodes_{'.'};
  static std::array<Type, 15> finished_;
  UInt cost_{0};
};

std::array<Type, 15> State::finished_ = {'.', '.', '.', '.', '.', '.', '.', 'A',
                                         'B', 'C', 'D', 'A', 'B', 'C', 'D'};

std::ostream& operator<<(std::ostream& os, State const& s)
{
  os << "#############\n"
     << '#' << s.node(0) << s.node(1) << '.' << s.node(2) << '.' << s.node(3) << '.' << s.node(4)
     << '.' << s.node(5) << s.node(6) << "#\n"
     << "###" << s.node(7) << '#' << s.node(8) << '#' << s.node(9) << '#' << s.node(10) << "###\n"
     << "  #" << s.node(11) << '#' << s.node(12) << '#' << s.node(13) << '#' << s.node(14) << "#\n"
     << "  #########\n";

  return os;
}

struct StateTranstitionManager
{
  bool is_finished(State const& state) { return state.finished(); }

  template<typename Inserter>
  void generate_children(State const& state, Inserter inserter)
  {
    for (unsigned i = 0; i < state.size(); ++i) {
      if (state.node(i) == '.') {
        continue;
      }

      auto [it_begin, it_end] = valid_moves.equal_range(i);
      for (auto move_it{it_begin}; move_it != it_end; ++move_it) {
        State next_state(state);
        UInt cost_delta = move_it->second.second * multipliers[state.node(i)];
        if (next_state.move(i, move_it->second.first, cost_delta)) {
          inserter(next_state, cost_delta);
        }
      }
    }
  }
};

auto main() -> int
{
  std::regex line2_re{R"(#(.)(.)\.(.)\.(.)\.(.)\.(.)(.)#)"};
  std::regex line3_re{"###(.)#(.)#(.)#(.)###"};
  std::regex line4_re{"#(.)#(.)#(.)#(.)#"};

  std::string line;
  std::smatch m;
  std::getline(std::cin, line);
  if (line != "#############") {
    std::cerr << "Incorrect first line.\n";
    return 1;
  }
  State initial_state{};

  std::getline(std::cin, line);
  if (!std::regex_search(line, m, line2_re)) {
    std::cerr << "Unable to match line 2 " << line << '\n';
    return 1;
  }
  for (unsigned i = 0; i < 7; ++i) {
    initial_state.node(i) = m.str(i + 1)[0];
  }

  std::getline(std::cin, line);
  if (!std::regex_search(line, m, line3_re)) {
    std::cerr << "Unable to match line 3 " << line << '\n';
    return 1;
  }
  for (unsigned i = 0; i < 4; ++i) {
    initial_state.node(7 + i) = m.str(i + 1)[0];
  }

  std::getline(std::cin, line);
  if (!std::regex_search(line, m, line4_re)) {
    std::cerr << "Unable to match line 4 " << line << '\n';
    return 1;
  }
  for (unsigned i = 0; i < 4; ++i) {
    initial_state.node(11 + i) = m.str(i + 1)[0];
  }

  auto [finished_state, finished_cost] =
    dijkstra(initial_state, UInt{0}, StateTranstitionManager{});
  std::cout << "Done with cost " << finished_cost << '\n';
  return 0;
}