Tifa's CP Library

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

Depends on

Code

#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/2/GRL_2_A"

#include "../../code/graph/kruskal.hpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, m;
  std::cin >> n >> m;
  vec<std::tuple<u32, u32, u32>> e(m);
  for (auto& [w, u, v] : e) std::cin >> u >> v >> w;
  std::ranges::sort(e);
  auto tr = tifa_libs::graph::kruskal<u32>(e, n);
  u32 ret = 0;
  for (u32 i = 0; i < n; ++i)
    for (auto [to, w] : tr.g[i]) ret += w;
  std::cout << ret / 2 << '\n';
  return 0;
}
#line 1 "src/test_cpverifier/aizu/grl_2_a.test.cpp"
#define PROBLEM "https://onlinejudge.u-aizu.ac.jp/courses/library/5/GRL/2/GRL_2_A"

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



#line 1 "src/code/ds/dsu_basic.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/ds/dsu_basic.hpp"

namespace tifa_libs::ds {

template <bool RANK_ = false>
class dsu_basic {
  vec<i32> p;

 public:
  explicit constexpr dsu_basic(u32 sz) : p(sz, -1) {}

  constexpr i32 find(u32 x) { return p[x] < 0 ? (i32)x : p[x] = find((u32)p[x]); }
  constexpr u32 size(u32 x) { return (u32)-p[(u32)find(x)]; }
  constexpr bool same(u32 x, u32 y) { return find(x) == find(y); }
  constexpr bool merge(u32 x, u32 y) {
    if ((x = (u32)find(x)) == (y = (u32)find(y))) return false;
    if constexpr (RANK_)
      if (p[x] > p[y]) std::swap(x, y);
    p[x] += p[y];
    p[y] = (i32)x;
    return true;
  }
};

}  // namespace tifa_libs::ds


#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 6 "src/code/graph/kruskal.hpp"

namespace tifa_libs::graph {

//! edge: w u v
//! edges MUST be sorted
template <class T>
constexpr treew<T> kruskal(vec<std::tuple<T, u32, u32>> sorted_a, u32 n) {
  treew<T> tr(n);
  ds::dsu_basic dsu(n);
  u32 m = n - 1;
  for (auto [w, u, v] : sorted_a) {
    if (dsu.merge(u, v)) tr.add_arc(u, v, w), tr.add_arc(v, u, w), --m;
    if (!m) break;
  }
  return tr;
}

}  // namespace tifa_libs::graph


#line 4 "src/test_cpverifier/aizu/grl_2_a.test.cpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, m;
  std::cin >> n >> m;
  vec<std::tuple<u32, u32, u32>> e(m);
  for (auto& [w, u, v] : e) std::cin >> u >> v >> w;
  std::ranges::sort(e);
  auto tr = tifa_libs::graph::kruskal<u32>(e, n);
  u32 ret = 0;
  for (u32 i = 0; i < n; ++i)
    for (auto [to, w] : tr.g[i]) ret += w;
  std::cout << ret / 2 << '\n';
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 00_sample1.in :heavy_check_mark: AC 9 ms 4 MB
g++-12 00_sample2.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 critical1.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 critical2.in :heavy_check_mark: AC 11 ms 4 MB
g++-12 critical3.in :heavy_check_mark: AC 23 ms 6 MB
g++-12 out1.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 out10.in :heavy_check_mark: AC 31 ms 6 MB
g++-12 out11.in :heavy_check_mark: AC 15 ms 4 MB
g++-12 out12.in :heavy_check_mark: AC 19 ms 5 MB
g++-12 out13.in :heavy_check_mark: AC 17 ms 4 MB
g++-12 out14.in :heavy_check_mark: AC 19 ms 5 MB
g++-12 out15.in :heavy_check_mark: AC 16 ms 4 MB
g++-12 out2.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 out3.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 out4.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 out5.in :heavy_check_mark: AC 8 ms 4 MB
g++-12 out6.in :heavy_check_mark: AC 31 ms 6 MB
g++-12 out7.in :heavy_check_mark: AC 31 ms 6 MB
g++-12 out8.in :heavy_check_mark: AC 31 ms 6 MB
g++-12 out9.in :heavy_check_mark: AC 31 ms 6 MB
Back to top page