Tifa's CP Library

:heavy_check_mark: ringenum3 (src/code/graph/ringenum3.hpp)

Depends on

Verified with

Code

#ifndef TIFALIBS_GRAPH_RINGENUM3
#define TIFALIBS_GRAPH_RINGENUM3

#include "alist.hpp"

namespace tifa_libs::graph {
namespace ringenum3_impl_ {
template <class F, bool with_deg>
constexpr void run(alist<with_deg> const& dg, F&& func) {
  u32 n = (u32)dg.g.size();
  vecb vis(n);
  for (u32 u = 0; u < n; ++u) {
    for (u32 v : dg.g[u]) vis[v].flip();
    for (u32 v : dg.g[u])
      for (u32 w : dg.g[v])
        if (vis[w]) func(u, v, w);
    for (u32 v : dg.g[u]) vis[v].flip();
  }
}
}  // namespace ringenum3_impl_

//! should be simple undirected graph
// func(u, v, w) forall {u,v,w} is C3
template <class F>
constexpr void ringenum3(vecu const& deg, vecpt<u32> const& edges, F&& func) {
  alist<false> dg((u32)deg.size());
  for (auto [u, v] : edges) {
    if (deg[u] < deg[v] || (deg[u] == deg[v] && u > v)) std::swap(u, v);
    dg.add_arc(u, v);
  }
  ringenum3_impl_::run(dg, std::forward<F>(func));
}
//! vertex ID: 0..n-1
//! should be simple undirected graph
// func(u, v, w) forall {u,v,w} is C3
template <class F>
constexpr void ringenum3(u32 n, vecpt<u32> const& edges, F&& func) {
  vecu deg(n);
  for (auto [u, v] : edges) ++deg[u], ++deg[v];
  ringenum3(deg, edges, std::forward<F>(func));
}
constexpr u64 ringcnt3(u32 n, vecpt<u32> const& edges) {
  u64 ans = 0;
  ringenum3(n, edges, [&](u32, u32, u32) { ++ans; });
  return ans;
}

}  // namespace tifa_libs::graph

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

namespace tifa_libs::graph {
namespace ringenum3_impl_ {
template <class F, bool with_deg>
constexpr void run(alist<with_deg> const& dg, F&& func) {
  u32 n = (u32)dg.g.size();
  vecb vis(n);
  for (u32 u = 0; u < n; ++u) {
    for (u32 v : dg.g[u]) vis[v].flip();
    for (u32 v : dg.g[u])
      for (u32 w : dg.g[v])
        if (vis[w]) func(u, v, w);
    for (u32 v : dg.g[u]) vis[v].flip();
  }
}
}  // namespace ringenum3_impl_

//! should be simple undirected graph
// func(u, v, w) forall {u,v,w} is C3
template <class F>
constexpr void ringenum3(vecu const& deg, vecpt<u32> const& edges, F&& func) {
  alist<false> dg((u32)deg.size());
  for (auto [u, v] : edges) {
    if (deg[u] < deg[v] || (deg[u] == deg[v] && u > v)) std::swap(u, v);
    dg.add_arc(u, v);
  }
  ringenum3_impl_::run(dg, std::forward<F>(func));
}
//! vertex ID: 0..n-1
//! should be simple undirected graph
// func(u, v, w) forall {u,v,w} is C3
template <class F>
constexpr void ringenum3(u32 n, vecpt<u32> const& edges, F&& func) {
  vecu deg(n);
  for (auto [u, v] : edges) ++deg[u], ++deg[v];
  ringenum3(deg, edges, std::forward<F>(func));
}
constexpr u64 ringcnt3(u32 n, vecpt<u32> const& edges) {
  u64 ans = 0;
  ringenum3(n, edges, [&](u32, u32, u32) { ++ans; });
  return ans;
}

}  // namespace tifa_libs::graph


Back to top page