Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/aizu/alds1_13_c.test.cpp

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_13_C"
#define TLE 10

#include "../../code/game/npuzzle_data.hpp"
#include "../../code/opt/astar.hpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  tifa_libs::game::NPuzzleData start(4);
  std::vector<u32> fin(16);
  std::iota(fin.begin(), fin.end(), 1);
  fin.back() = 0;
  tifa_libs::game::NPuzzleData::set_fin(4, fin);
  tifa_libs::game::NPuzzleData::limit = 100;
  std::cin >> start;
  std::cout << tifa_libs::opt::astar(start)->moves.size() << '\n';
  return 0;
}
#line 1 "src/test_cpverifier/aizu/alds1_13_c.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_13_C"
#define TLE 10

#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


#line 1 "src/code/opt/astar.hpp"



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



#line 5 "src/code/util/traits.hpp"

namespace tifa_libs {

template <class T>
concept iterable_c = requires(T v) {
  { v.begin() } -> std::same_as<typename T::iterator>;
  { v.end() } -> std::same_as<typename T::iterator>;
};

template <class T>
concept container_c = iterable_c<T> && !std::derived_from<T, std::basic_string<typename T::value_type>>;

template <class T>
constexpr bool is_char_v = std::is_same_v<T, char> || std::is_same_v<T, signed char> || std::is_same_v<T, unsigned char>;
template <class T>
concept char_c = is_char_v<T>;

template <class T>
constexpr bool is_s128_v = std::is_same_v<T, __int128_t> || std::is_same_v<T, __int128>;
template <class T>
concept s128_c = is_s128_v<T>;

template <class T>
constexpr bool is_u128_v = std::is_same_v<T, __uint128_t> || std::is_same_v<T, unsigned __int128>;
template <class T>
concept u128_c = is_u128_v<T>;

template <class T>
constexpr bool is_i128_v = is_s128_v<T> || is_u128_v<T>;
template <class T>
concept i128_c = is_u128_v<T>;

template <class T>
constexpr bool is_int_v = std::is_integral_v<T> || is_i128_v<T>;
template <class T>
concept int_c = is_int_v<T>;

template <class T>
constexpr bool is_sint_v = is_s128_v<T> || (is_int_v<T> && std::is_signed_v<T>);
template <class T>
concept sint_c = is_sint_v<T>;

template <class T>
constexpr bool is_uint_v = is_u128_v<T> || (is_int_v<T> && std::is_unsigned_v<T>);
template <class T>
concept uint_c = is_uint_v<T>;

template <class T>
concept mint_c = requires(T x) {
  { x.mod() } -> uint_c;
  { x.val() } -> uint_c;
};

template <class T>
constexpr bool is_arithm_v = std::is_arithmetic_v<T> || is_int_v<T>;
template <class T>
concept arithm_c = is_arithm_v<T>;

template <class T>
struct to_sint : std::make_signed<T> {};
template <>
struct to_sint<u128> {
  using type = u128;
};
template <>
struct to_sint<i128> {
  using type = u128;
};
template <class T>
using to_sint_t = typename to_sint<T>::type;

template <class T>
struct to_uint : std::make_unsigned<T> {};
template <>
struct to_uint<u128> {
  using type = u128;
};
template <>
struct to_uint<i128> {
  using type = u128;
};
template <class T>
using to_uint_t = typename to_uint<T>::type;

}  // namespace tifa_libs


#line 5 "src/code/opt/astar.hpp"

namespace tifa_libs::opt {

template <class T>
requires requires(T x, T y) {
  { x.solved() } -> std::same_as<bool>;
  { x.next() } -> iterable_c;
  x.cost() < y.cost();
  x < y;
}
std::optional<T> astar(T const &s) {
  struct C {
    constexpr bool operator()(T const &a, T const &b) const { return b.cost() < a.cost(); }
  };
  pq<T, C> pq;
  std::set<T> vis;

  pq.push(s);
  vis.insert(s);
  while (!pq.empty()) {
    T now = pq.top();
    pq.pop();
    if (now.solved()) return now;
    auto nxt = now.next();
    for (auto i : nxt)
      if (!vis.count(i)) {
        pq.push(i);
        vis.insert(i);
      }
  }
  return std::nullopt;
}

}  // namespace tifa_libs::opt


#line 6 "src/test_cpverifier/aizu/alds1_13_c.test.cpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  tifa_libs::game::NPuzzleData start(4);
  std::vector<u32> fin(16);
  std::iota(fin.begin(), fin.end(), 1);
  fin.back() = 0;
  tifa_libs::game::NPuzzleData::set_fin(4, fin);
  tifa_libs::game::NPuzzleData::limit = 100;
  std::cin >> start;
  std::cout << tifa_libs::opt::astar(start)->moves.size() << '\n';
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 00_sample_00.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 01_short_00.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 01_short_01.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 01_short_02.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 01_short_03.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 01_short_04.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 01_short_05.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 01_short_06.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 01_short_07.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 02_middle_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 02_middle_01.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 02_middle_02.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 02_middle_03.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 03_long_00.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 03_long_01.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 03_long_02.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 03_long_03.in :heavy_check_mark: AC 11 ms 4 MB
g++-12 03_long_04.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 03_long_05.in :heavy_check_mark: AC 10 ms 4 MB
g++-12 03_long_06.in :heavy_check_mark: AC 27 ms 8 MB
g++-12 03_long_07.in :heavy_check_mark: AC 4305 ms 606 MB
g++-12 03_long_08.in :heavy_check_mark: AC 1354 ms 216 MB
g++-12 03_long_09.in :heavy_check_mark: AC 2548 ms 377 MB
g++-12 04_corner_00.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 05_extreme_00.in :heavy_check_mark: AC 4858 ms 665 MB
g++-12 05_extreme_01.in :heavy_check_mark: AC 1663 ms 254 MB
g++-12 05_extreme_02.in :heavy_check_mark: AC 2067 ms 317 MB
g++-12 05_extreme_03.in :heavy_check_mark: AC 3775 ms 544 MB
Back to top page