test/verify/aoj-grl-2-a-2.test.cpp

• View this file on GitHub
• Last update: 2026-08-10 10:49:23+00:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_2_A

Depends on

• Graph Template (グラフテンプレート) (graph/graph-template.hpp)
• Kruskal (最小全域木) (graph/mst/kruskal.hpp)
• Union Find (structure/union-find/union-find.hpp)

Code

// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_2_A
// clang-format on

#include <iostream>

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

using namespace std;

int main() {
  int V, E;
  cin >> V >> E;
  Edges<int> edges;
  for (int i = 0; i < E; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    edges.emplace_back(a, b, c);
  }
  cout << kruskal(edges, V).cost << "\n";
}

#line 1 "test/verify/aoj-grl-2-a-2.test.cpp"
// clang-format off
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_2_A
// clang-format on

#include <iostream>

#line 2 "graph/mst/kruskal.hpp"

#include <algorithm>
#include <iterator>

#line 2 "structure/union-find/union-find.hpp"

#line 4 "structure/union-find/union-find.hpp"
#include <cstddef>
#include <utility>
#include <vector>

struct UnionFind {
  std::vector<int> data;

  UnionFind() = default;

  explicit UnionFind(std::size_t sz) : data(sz, -1) {}

  bool unite(int x, int y) {
    x = find(x), y = find(y);
    if (x == y) return false;
    if (data[x] > data[y]) std::swap(x, y);
    data[x] += data[y];
    data[y] = x;
    return true;
  }

  int find(int k) {
    if (data[k] < 0) return (k);
    return data[k] = find(data[k]);
  }

  int size(int k) { return -data[find(k)]; }

  bool same(int x, int y) { return find(x) == find(y); }

  std::vector<std::vector<int>> groups() {
    int n = (int)data.size();
    std::vector<std::vector<int>> ret(n);
    for (int i = 0; i < n; i++) {
      ret[find(i)].emplace_back(i);
    }
    ret.erase(
        std::remove_if(ret.begin(), ret.end(),
                       [&](const std::vector<int>& v) { return v.empty(); }),
        ret.end());
    return ret;
  }
};
#line 2 "graph/graph-template.hpp"

#line 6 "graph/graph-template.hpp"

template <typename T = int>
struct Edge {
  int from, to;
  T cost;
  int idx;

  Edge() = default;

  Edge(int from, int to, T cost = 1, int idx = -1)
      : from(from), to(to), cost(cost), idx(idx) {}

  operator int() const { return to; }
};

template <typename T = int>
struct Graph {
  std::vector<std::vector<Edge<T> > > g;
  int es;

  Graph() = default;

  explicit Graph(int n) : g(n), es(0) {}

  std::size_t size() const { return g.size(); }

  void add_directed_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es++);
  }

  void add_edge(int from, int to, T cost = 1) {
    g[from].emplace_back(from, to, cost, es);
    g[to].emplace_back(to, from, cost, es++);
  }

  void read(int M, int padding = -1, bool weighted = false,
            bool directed = false) {
    for (int i = 0; i < M; i++) {
      int a, b;
      std::cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if (weighted) std::cin >> c;
      if (directed)
        add_directed_edge(a, b, c);
      else
        add_edge(a, b, c);
    }
  }

  inline std::vector<Edge<T> >& operator[](const int& k) { return g[k]; }

  inline const std::vector<Edge<T> >& operator[](const int& k) const {
    return g[k];
  }
};

template <typename T = int>
using Edges = std::vector<Edge<T> >;
#line 8 "graph/mst/kruskal.hpp"

/**
 * @brief Kruskal(最小全域木)
 *
 */
template <typename T>
struct MinimumSpanningTree {
  T cost;
  Edges<T> edges;
};

template <typename T>
MinimumSpanningTree<T> kruskal(Edges<T>& edges, int V) {
  std::sort(std::begin(edges), std::end(edges),
            [](const Edge<T>& a, const Edge<T>& b) { return a.cost < b.cost; });
  UnionFind tree(V);
  T total = T();
  Edges<T> es;
  for (auto& e : edges) {
    if (tree.unite(e.from, e.to)) {
      es.emplace_back(e);
      total += e.cost;
    }
  }
  return {total, es};
}
#line 8 "test/verify/aoj-grl-2-a-2.test.cpp"

using namespace std;

int main() {
  int V, E;
  cin >> V >> E;
  Edges<int> edges;
  for (int i = 0; i < E; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    edges.emplace_back(a, b, c);
  }
  cout << kruskal(edges, V).cost << "\n";
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample1	AC	3 ms	4 MB
g++	00_sample2	AC	2 ms	4 MB
g++	critical1	AC	2 ms	4 MB
g++	critical2	AC	8 ms	4 MB
g++	critical3	AC	54 ms	5 MB
g++	out1	AC	3 ms	4 MB
g++	out10	AC	61 ms	5 MB
g++	out11	AC	20 ms	4 MB
g++	out12	AC	35 ms	4 MB
g++	out13	AC	27 ms	4 MB
g++	out14	AC	33 ms	4 MB
g++	out15	AC	24 ms	4 MB
g++	out2	AC	2 ms	4 MB
g++	out3	AC	2 ms	3 MB
g++	out4	AC	2 ms	4 MB
g++	out5	AC	2 ms	3 MB
g++	out6	AC	60 ms	6 MB
g++	out7	AC	62 ms	7 MB
g++	out8	AC	62 ms	6 MB
g++	out9	AC	61 ms	5 MB
clang++	00_sample1	AC	3 ms	4 MB
clang++	00_sample2	AC	2 ms	4 MB
clang++	critical1	AC	2 ms	4 MB
clang++	critical2	AC	9 ms	4 MB
clang++	critical3	AC	52 ms	7 MB
clang++	out1	AC	3 ms	4 MB
clang++	out10	AC	61 ms	6 MB
clang++	out11	AC	21 ms	4 MB
clang++	out12	AC	35 ms	4 MB
clang++	out13	AC	27 ms	4 MB
clang++	out14	AC	32 ms	4 MB
clang++	out15	AC	24 ms	4 MB
clang++	out2	AC	3 ms	4 MB
clang++	out3	AC	2 ms	4 MB
clang++	out4	AC	2 ms	4 MB
clang++	out5	AC	2 ms	4 MB
clang++	out6	AC	63 ms	6 MB
clang++	out7	AC	64 ms	6 MB
clang++	out8	AC	63 ms	7 MB
clang++	out9	AC	65 ms	6 MB

Back to top page