Tifa's CP Library

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

Depends on

Code

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

#include "../../code/graph/path.hpp"
#include "../../code/io/ios_container.hpp"
#include "../../code/tree/diam.hpp"
#include "../../code/tree/treew.hpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n;
  std::cin >> n;
  tifa_libs::graph::treew<u64> tr(n);
  for (u32 i = 1, u, v, w; i < n; ++i) {
    std::cin >> u >> v >> w;
    tr.add_arc(u, v, (u64)w), tr.add_arc(v, u, (u64)w);
  }
  auto [u, v, w] = tifa_libs::graph::tree_diam(tr);
  auto p = tifa_libs::graph::path(tr, u, v).value();
  std::cout << w << ' ' << p.size() << '\n';
  std::cout << p << '\n';
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/tree_diameter.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/tree_diameter"

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



#line 1 "src/code/graph/alist.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/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/path.hpp"

namespace tifa_libs::graph {

template <class G>
constexpr std::optional<vecu> path(G const &g, u32 from, u32 to) {
  vecu ret;
  bool failed = true;
  auto dfs = [&](auto &&dfs, u32 now, u32 fa) -> void {
    ret.push_back(now);
    if (now == to) {
      failed = false;
      return;
    }
    for (auto v : g.g[now]) {
      u32 to = 0;
      if constexpr (is_alist<G>) to = v;
      else to = v.first;
      if (to == fa) continue;
      dfs(dfs, to, now);
      if (!failed) return;
    }
    if (!failed) return;
    ret.pop_back();
  };

  dfs(dfs, from, -1_u32);
  if (failed) return {};
  return ret;
}

}  // namespace tifa_libs::graph


#line 1 "src/code/io/ios_container.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/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/diam.hpp"



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



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



#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 5 "src/code/tree/dfs_info.hpp"

namespace tifa_libs::graph {

enum tree_dfs_info_mask {
  td_dfn = 1,
  td_sz = 2,
  td_fa = 4,
  td_dep = 8,
  td_maxson = 16,
  td_maxdfn = 32,
  td_euler = 64,
  td_go = 128,
  td_dis = 256
};

template <class G>
struct tree_dfs_info {
  using weight_type = typename G::weight_type;

  vecu dfn, sz, fa, dep, maxson, maxdfn, euler;
  vvecu go;
  vec<weight_type> dis;

  template <int state>
  constexpr tree_dfs_info& reset_dfs_info(G const& tree) {
    u32 n = (u32)tree.g.size();
    if constexpr (state & td_dfn) dfn = vecu(n);
    if constexpr (state & (td_sz | td_maxson)) sz = vecu(n);
    if constexpr (state & td_fa) fa = vecu(n);
    if constexpr (state & td_dep) dep = vecu(n);
    if constexpr (state & td_maxson) maxson = vecu(n, n);
    if constexpr (state & td_maxdfn) maxdfn = vecu(n);
    if constexpr (state & td_euler) euler = vecu(n);
    if constexpr (state & td_go) go = vvecu(n, vecu(21u, n));
    if constexpr (state & td_dis) dis = vec<weight_type>(n);

    u32 cnt = 0;
    dfs(
        tree, tree.root,
        [&](u32 u, u32 f) {
          if constexpr (state & td_dfn) dfn[u] = cnt;
          if constexpr (state & td_euler) euler[cnt] = u;
          if constexpr (state & (td_dfn | td_maxdfn | td_euler)) ++cnt;
          if constexpr (state & (td_sz | td_maxson)) sz[u] = 1;
          if constexpr (state & td_fa) fa[u] = f;
          if constexpr (state & td_go) {
            go[u][0] = f;
            for (u32 i = 1; i <= 20u && go[u][i - 1] < n; i++) go[u][i] = go[go[u][i - 1]][i - 1];
          }
        },
        [&](u32 to, u32 u, weight_type const& w = 1) {
          if constexpr (state & td_dep) dep[to] = dep[u] + 1;
          if constexpr (state & td_dis) dis[to] = dis[u] + w;
        },
        [&](u32 to, u32 u, weight_type const& = 1) {
          if constexpr (state & (td_sz | td_maxson)) sz[u] += sz[to];
          if constexpr (state & td_maxson)
            if (maxson[u] == n || sz[to] > sz[maxson[u]]) maxson[u] = to;
        },
        [&](u32 u, u32) {
          if constexpr (state & td_maxdfn) maxdfn[u] = cnt - 1;
        });
    return *this;
  }
};

}  // namespace tifa_libs::graph


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

namespace tifa_libs::graph {

// {u, v, diam}
template <class G>
constexpr auto tree_diam(G& tree) {
  auto _ = tree.root;
  tree_dfs_info<G> info;
  auto d = info.template reset_dfs_info<td_dis>(tree).dis;
  u32 u = tree.root = u32(std::ranges::max_element(d) - d.begin());
  d = info.template reset_dfs_info<td_dis>(tree).dis;
  u32 v = u32(std::ranges::max_element(d) - d.begin());
  tree.root = _;
  return std::make_tuple(u, v, d[v]);
}

// diam
template <class G>
constexpr auto tree_diam_d(G const& tree) {
  using T = typename G::weight_type;
  vec<T> mdis(tree.g.size());
  T d = 0;
  dfs(
      tree, tree.root, fn_0, fn_0,
      [&](u32 to, u32 u, T const& w = 1) {
        d = std::max(d, mdis[u] + mdis[to] + w);
        mdis[u] = std::max(mdis[u], mdis[to] + w);
      },
      fn_0);
  return d;
}

}  // namespace tifa_libs::graph


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



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



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

namespace tifa_libs::graph {

template <class T, bool with_deg = false>
struct alistw {
  using weight_type = T;
  using value_type = vvecp<u32, T>;
  value_type g;
  u32 cnt_arc;
  vecu deg_in;

  //! vertex ID: [0, n)
  explicit constexpr alistw(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, T const& w) {
    g[u].emplace_back(v, w), ++cnt_arc;
    if constexpr (with_deg) ++deg_in[v];
  }
};

}  // namespace tifa_libs::graph


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

namespace tifa_libs::graph {

template <class T>
struct treew : alistw<T, false> {
  u32 root;

  explicit constexpr treew(u32 n, u32 root = 0) : alistw<T>(n), root(root) {}
};

}  // namespace tifa_libs::graph


#line 7 "src/test_cpverifier/library-checker/tree_diameter.test.cpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n;
  std::cin >> n;
  tifa_libs::graph::treew<u64> tr(n);
  for (u32 i = 1, u, v, w; i < n; ++i) {
    std::cin >> u >> v >> w;
    tr.add_arc(u, v, (u64)w), tr.add_arc(v, u, (u64)w);
  }
  auto [u, v, w] = tifa_libs::graph::tree_diam(tr);
  auto p = tifa_libs::graph::path(tr, u, v).value();
  std::cout << w << ' ' << p.size() << '\n';
  std::cout << p << '\n';
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 10 ms 4 MB
g++-12 hack_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 line_00 :heavy_check_mark: AC 448 ms 84 MB
g++-12 max_random_00 :heavy_check_mark: AC 312 ms 52 MB
g++-12 max_random_01 :heavy_check_mark: AC 321 ms 52 MB
g++-12 random_00 :heavy_check_mark: AC 232 ms 42 MB
g++-12 random_01 :heavy_check_mark: AC 293 ms 49 MB
g++-12 random_02 :heavy_check_mark: AC 28 ms 8 MB
g++-12 random_03 :heavy_check_mark: AC 241 ms 45 MB
g++-12 random_04 :heavy_check_mark: AC 158 ms 30 MB
g++-12 small_random_00 :heavy_check_mark: AC 10 ms 4 MB
g++-12 small_random_01 :heavy_check_mark: AC 8 ms 4 MB
g++-12 small_random_02 :heavy_check_mark: AC 8 ms 4 MB
g++-12 small_random_03 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_random_04 :heavy_check_mark: AC 8 ms 4 MB
g++-12 uni_00 :heavy_check_mark: AC 181 ms 50 MB
Back to top page