Tifa's CP Library

:heavy_check_mark: npuzzle_data (src/code/game/npuzzle_data.hpp)

Depends on

Verified with

Code

#ifndef TIFALIBS_GAME_NPUZZLE_DATA
#define TIFALIBS_GAME_NPUZZLE_DATA

#include "../util/util.hpp"

namespace tifa_libs::game {

// n = k*k-1
class NPuzzleData {
  static inline vecu fin_node, fin_pos;
  static inline vvecu pos_cost;

  u32 k, pos0;
  u32 cost_;

 public:
  static inline u32 limit = UINT32_MAX;
  static constexpr void set_fin(u32 k, vecu const &fin) {
    assert(fin.size() == k * k);
    fin_node = fin;
    fin_pos.resize(k * k);
    for (u32 i = 0; i < k * k; ++i) fin_pos[fin_node[i]] = i;
    pos_cost.resize(k * k, vecu(k * k));
    for (u32 p = 1; p < k * k; ++p)
      for (u32 q = 0; q < k * k; ++q) pos_cost[p][q] = u32(abs(i32(p / k) - i32(q / k)) + abs(i32(p % k) - i32(q % k)));
  }

  vecu node;
  strn moves;

  constexpr explicit NPuzzleData(u32 k) : k(k), pos0(0), cost_(0), node(k * k), moves() {}

  constexpr auto const &cost() const { return cost_; }
  constexpr bool solved() { return node == fin_node; }
  constexpr vec<NPuzzleData> next() {
    strn moves;
    {
      char lst = moves.back();
      if (pos0 / k && lst != 'D') moves += 'U';
      if (pos0 / k != k - 1 && lst != 'U') moves += 'D';
      if (pos0 % k && lst != 'R') moves += 'L';
      if (pos0 % k != k - 1 && lst != 'L') moves += 'R';
    }
    vec<NPuzzleData> ans;
    for (char d : moves) {
      auto nxt = *this;
      nxt.move(d);
      if (nxt.cost_ <= limit) ans.push_back(nxt);
    }
    return ans;
  }
  constexpr void move(char dir) {
    moves.push_back(dir);
    ++cost_;
    u32 _ = pos0;
    switch (dir) {
      case 'U': pos0 -= k; break;
      case 'D': pos0 += k; break;
      case 'L': --pos0; break;
      case 'R': ++pos0; break;
    }
    cost_ += pos_cost[_][fin_pos[node[pos0]]];
    cost_ -= pos_cost[pos0][fin_pos[node[pos0]]];
    std::swap(node[_], node[pos0]);
  }
  constexpr auto operator<=>(NPuzzleData const &r) const { return node <=> r.node; }
  friend std::istream &operator>>(std::istream &is, NPuzzleData &np) {
    for (auto &i : np.node) is >> i;
    np.pos0 = u32(std::ranges::find(np.node, 0) - np.node.begin());
    for (u32 p = 0; p < np.node.size(); ++p)
      if (np.node[p]) np.cost_ += pos_cost[p][fin_pos[np.node[p]]];
    return is;
  }
};

}  // namespace tifa_libs::game

#endif
#line 1 "src/code/game/npuzzle_data.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/game/npuzzle_data.hpp"

namespace tifa_libs::game {

// n = k*k-1
class NPuzzleData {
  static inline vecu fin_node, fin_pos;
  static inline vvecu pos_cost;

  u32 k, pos0;
  u32 cost_;

 public:
  static inline u32 limit = UINT32_MAX;
  static constexpr void set_fin(u32 k, vecu const &fin) {
    assert(fin.size() == k * k);
    fin_node = fin;
    fin_pos.resize(k * k);
    for (u32 i = 0; i < k * k; ++i) fin_pos[fin_node[i]] = i;
    pos_cost.resize(k * k, vecu(k * k));
    for (u32 p = 1; p < k * k; ++p)
      for (u32 q = 0; q < k * k; ++q) pos_cost[p][q] = u32(abs(i32(p / k) - i32(q / k)) + abs(i32(p % k) - i32(q % k)));
  }

  vecu node;
  strn moves;

  constexpr explicit NPuzzleData(u32 k) : k(k), pos0(0), cost_(0), node(k * k), moves() {}

  constexpr auto const &cost() const { return cost_; }
  constexpr bool solved() { return node == fin_node; }
  constexpr vec<NPuzzleData> next() {
    strn moves;
    {
      char lst = moves.back();
      if (pos0 / k && lst != 'D') moves += 'U';
      if (pos0 / k != k - 1 && lst != 'U') moves += 'D';
      if (pos0 % k && lst != 'R') moves += 'L';
      if (pos0 % k != k - 1 && lst != 'L') moves += 'R';
    }
    vec<NPuzzleData> ans;
    for (char d : moves) {
      auto nxt = *this;
      nxt.move(d);
      if (nxt.cost_ <= limit) ans.push_back(nxt);
    }
    return ans;
  }
  constexpr void move(char dir) {
    moves.push_back(dir);
    ++cost_;
    u32 _ = pos0;
    switch (dir) {
      case 'U': pos0 -= k; break;
      case 'D': pos0 += k; break;
      case 'L': --pos0; break;
      case 'R': ++pos0; break;
    }
    cost_ += pos_cost[_][fin_pos[node[pos0]]];
    cost_ -= pos_cost[pos0][fin_pos[node[pos0]]];
    std::swap(node[_], node[pos0]);
  }
  constexpr auto operator<=>(NPuzzleData const &r) const { return node <=> r.node; }
  friend std::istream &operator>>(std::istream &is, NPuzzleData &np) {
    for (auto &i : np.node) is >> i;
    np.pos0 = u32(std::ranges::find(np.node, 0) - np.node.begin());
    for (u32 p = 0; p < np.node.size(); ++p)
      if (np.node[p]) np.cost_ += pos_cost[p][fin_pos[np.node[p]]];
    return is;
  }
};

}  // namespace tifa_libs::game


Back to top page