Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/rooted_tree_isomorphism_classification.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/rooted_tree_isomorphism_classification"

#include "../../code/edh/hash_splitmix64.hpp"
#include "../../code/io/ios_container.hpp"
#include "../../code/tree/tree_hash_rooted.hpp"

int main() {
  tifa_libs::hash_splitmix64::set_seed();
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n;
  std::cin >> n;
  tifa_libs::graph::tree tr(n);
  for (u32 i = 1, p; i < n; ++i) {
    std::cin >> p;
    tr.add_arc(i, p), tr.add_arc(p, i);
  }
  auto ans = tifa_libs::graph::tree_hash_rooted(tr, tifa_libs::hash_splitmix64());
  std::map<u64, vecu> dict;
  for (u32 i = 0; i < n; ++i) dict[ans[i]].push_back(i);
  std::cout << dict.size() << '\n';
  u32 cnt = 0;
  for (auto&& [k, v] : dict) {
    for (auto i : v) ans[i] = cnt;
    ++cnt;
  }
  std::cout << ans << '\n';
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/rooted_tree_isomorphism_classification.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/rooted_tree_isomorphism_classification"

#line 1 "src/code/edh/hash_splitmix64.hpp"



#line 1 "src/code/util/traits.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&&...) {};
inline const auto fn_is0 = [](auto x) { return x == 0; };


#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/edh/hash_splitmix64.hpp"

namespace tifa_libs {

class hash_splitmix64 {
  static inline u64 seed = 114514;
  static constexpr u64 splitmix64(u64 x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  static constexpr u64 append(u64 x, u64 y) { return x ^ (y >> 1) ^ ((y & 1) << 63); }

 public:
  explicit hash_splitmix64() { set_seed(); }
  explicit constexpr hash_splitmix64(u64 s) { set_seed(s); }

  static void set_seed() { seed = (u64)std::chrono::steady_clock::now().time_since_epoch().count(); }
  static constexpr void set_seed(u64 s) { seed = s; }
  u64 operator()(u64 x) const { return splitmix64(x + seed); }

  template <class T, class U>
  u64 operator()(std::pair<T, U> const &p) const { return append((*this)(p.first), (*this)(p.second)); }
  template <class... Ts>
  u64 operator()(std::tuple<Ts...> const &tp) const {
    u64 ret = 0;
    std::apply([&](Ts const &...targs) { ((ret = append(ret, (*this)(targs))), ...); }, tp);
    return ret;
  }
  template <iterable_c T>
  u64 operator()(T const &tp) const {
    u64 ret = 0;
    for (auto &&i : tp) ret = append(ret, (*this)(i));
    return ret;
  }
};
template <class T>
using hset = std::unordered_set<T, hash_splitmix64>;
template <class K, class V>
using hmap = std::unordered_map<K, V, hash_splitmix64>;

}  // namespace tifa_libs


#line 1 "src/code/io/ios_container.hpp"



#line 5 "src/code/io/ios_container.hpp"

template <tifa_libs::container_c T>
std::istream &operator>>(std::istream &is, T &x) {
  for (auto &i : x) is >> i;
  return is;
}
template <tifa_libs::container_c T>
std::ostream &operator<<(std::ostream &os, T const &x) {
  if (x.begin() == x.end()) return os;
  auto it = x.begin();
  os << *it++;
  for (; it != x.end(); ++it) os << ' ' << *it;
  return os;
}


#line 1 "src/code/tree/tree_hash_rooted.hpp"



#line 1 "src/code/graph/dfs.hpp"



#line 1 "src/code/graph/alist.hpp"



#line 5 "src/code/graph/alist.hpp"

namespace tifa_libs::graph {

template <bool with_deg = false>
struct alist {
  using weight_type = u32;
  using value_type = vvecu;
  value_type g;
  u32 cnt_arc;
  vecu deg_in;

  //! vertex ID: [0, n)
  explicit constexpr alist(u32 n = 0) : g(n), cnt_arc(0), deg_in(0) {
    if constexpr (with_deg) deg_in.resize(n);
  }

  constexpr void add_arc(u32 u, u32 v) {
    g[u].push_back(v), ++cnt_arc;
    if constexpr (with_deg) ++deg_in[v];
  }
};
template <class G>
concept is_alist = (std::is_base_of_v<alist<true>, G> || std::is_base_of_v<alist<false>, G>);

}  // namespace tifa_libs::graph


#line 5 "src/code/graph/dfs.hpp"

namespace tifa_libs::graph {
namespace dfs_impl_ {
template <class G, class Fb, class Fp, class Fs, class Fr>
constexpr void dfs_(G const& fg, u32 u, u32 fa, Fb&& init, Fp&& pre_dfs, Fs&& post_dfs, Fr&& before_return) {
  init(u, fa);
  for (auto v : fg.g[u])
    if constexpr (is_alist<G>) {
      if (v != fa) {
        pre_dfs(v, u);
        dfs_(fg, v, u, std::forward<Fb>(init), std::forward<Fp>(pre_dfs), std::forward<Fs>(post_dfs), std::forward<Fr>(before_return));
        post_dfs(v, u);
      }
    } else {
      if (v.first != fa) {
        pre_dfs(v.first, u, v.second);
        dfs_(fg, v.first, u, std::forward<Fb>(init), std::forward<Fp>(pre_dfs), std::forward<Fs>(post_dfs), std::forward<Fr>(before_return));
        post_dfs(v.first, u, v.second);
      }
    }
  before_return(u, fa);
}
}  // namespace dfs_impl_

template <class G, class Fb, class Fp, class Fs, class Fr>
constexpr void dfs(G const& fg, u32 start, Fb&& init, Fp&& pre_dfs, Fs&& post_dfs, Fr&& before_return) { dfs_impl_::dfs_(fg, start, -1_u32, std::forward<Fb>(init), std::forward<Fp>(pre_dfs), std::forward<Fs>(post_dfs), std::forward<Fr>(before_return)); }

}  // namespace tifa_libs::graph


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



#line 5 "src/code/tree/tree.hpp"

namespace tifa_libs::graph {

struct tree : alist<false> {
  u32 root;

  explicit constexpr tree(u32 n, u32 root = 0) : alist(n), root(root) {}
};

}  // namespace tifa_libs::graph


#line 6 "src/code/tree/tree_hash_rooted.hpp"

namespace tifa_libs::graph {

template <class Hash, u64 OFFSET = 1>
constexpr vecu64 tree_hash_rooted(tree const &tr, Hash &&hasher) {
  vecu64 hash(tr.g.size(), OFFSET);
  dfs(
      tr, tr.root,
      fn_0,
      fn_0,
      [&](u32 to, u32 u, u32 = 1) {
        hash[u] += hasher(hash[to]);
      },
      fn_0);
  return hash;
}

}  // namespace tifa_libs::graph


#line 6 "src/test_cpverifier/library-checker/rooted_tree_isomorphism_classification.test.cpp"

int main() {
  tifa_libs::hash_splitmix64::set_seed();
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n;
  std::cin >> n;
  tifa_libs::graph::tree tr(n);
  for (u32 i = 1, p; i < n; ++i) {
    std::cin >> p;
    tr.add_arc(i, p), tr.add_arc(p, i);
  }
  auto ans = tifa_libs::graph::tree_hash_rooted(tr, tifa_libs::hash_splitmix64());
  std::map<u64, vecu> dict;
  for (u32 i = 0; i < n; ++i) dict[ans[i]].push_back(i);
  std::cout << dict.size() << '\n';
  u32 cnt = 0;
  for (auto&& [k, v] : dict) {
    for (auto i : v) ans[i] = cnt;
    ++cnt;
  }
  std::cout << ans << '\n';
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 8 ms 4 MB
g++-12 example_01 :heavy_check_mark: AC 8 ms 4 MB
g++-12 max_isomorphic_00 :heavy_check_mark: AC 180 ms 40 MB
g++-12 max_isomorphic_01 :heavy_check_mark: AC 183 ms 40 MB
g++-12 max_line_00 :heavy_check_mark: AC 566 ms 110 MB
g++-12 max_random_00 :heavy_check_mark: AC 234 ms 42 MB
g++-12 max_random_01 :heavy_check_mark: AC 249 ms 42 MB
g++-12 max_random_02 :heavy_check_mark: AC 231 ms 42 MB
g++-12 max_random_03 :heavy_check_mark: AC 232 ms 42 MB
g++-12 max_random_04 :heavy_check_mark: AC 228 ms 42 MB
g++-12 max_star_00 :heavy_check_mark: AC 69 ms 40 MB
g++-12 small_random_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_random_01 :heavy_check_mark: AC 7 ms 4 MB
g++-12 small_random_02 :heavy_check_mark: AC 8 ms 4 MB
g++-12 sqrt_00 :heavy_check_mark: AC 34 ms 16 MB
Back to top page