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

• View this file on GitHub
• Last update: 2024-04-24 02:34:04+09:00
• Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_2_A

Depends on

• Graph Template(グラフテンプレート) (graph/graph-template.hpp)
• Prim(最小全域木) (graph/mst/prim.hpp)
• template/template.hpp

Code

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

#include "../../template/template.hpp"

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

int main() {
  int V, E;
  cin >> V >> E;
  Graph<> g(V);
  g.read(E, 0, true);
  cout << prim(g).cost << "\n";
}

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

#line 1 "template/template.hpp"
#include<bits/stdc++.h>

using namespace std;

using int64 = long long;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  explicit FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};
 
template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}
#line 4 "test/verify/aoj-grl-2-a.test.cpp"

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

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

/**
 * @brief Graph Template(グラフテンプレート)
 */
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 {
  vector< vector< Edge< T > > > g;
  int es;

  Graph() = default;

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

  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;
      cin >> a >> b;
      a += padding;
      b += padding;
      T c = T(1);
      if(weighted) cin >> c;
      if(directed) add_directed_edge(a, b, c);
      else add_edge(a, b, c);
    }
  }

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

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

template< typename T = int >
using Edges = vector< Edge< T > >;
#line 4 "graph/mst/prim.hpp"

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

template< typename T >
MinimumSpanningTree< T > prim(const Graph< T > &g) {
  T total = T();
  vector< int > used(g.size());
  vector< Edge< T > * > dist(g.size());
  using pi = pair< T, int >;
  priority_queue< pi, vector< pi >, greater<> > que;
  que.emplace(T(), 0);
  Edges< T > edges;
  while(!que.empty()) {
    auto p = que.top();
    que.pop();
    if(used[p.second]) continue;
    used[p.second] = true;
    total += p.first;
    if(dist[p.second]) edges.emplace_back(*dist[p.second]);
    for(auto &e : g[p.second]) {
      if(used[e.to] || (dist[e.to] && dist[e.to]->cost <= e.cost)) continue;
      que.emplace(e.cost, e.to);
    }
  }
  return {total, edges};
}
#line 6 "test/verify/aoj-grl-2-a.test.cpp"

int main() {
  int V, E;
  cin >> V >> E;
  Graph<> g(V);
  g.read(E, 0, true);
  cout << prim(g).cost << "\n";
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	00_sample1.in	AC	6 ms	4 MB
g++	00_sample2.in	AC	6 ms	4 MB
g++	critical1.in	AC	6 ms	4 MB
g++	critical2.in	AC	8 ms	4 MB
g++	critical3.in	AC	27 ms	8 MB
g++	out1.in	AC	6 ms	4 MB
g++	out10.in	AC	39 ms	10 MB
g++	out11.in	AC	15 ms	6 MB
g++	out12.in	AC	22 ms	7 MB
g++	out13.in	AC	19 ms	6 MB
g++	out14.in	AC	21 ms	6 MB
g++	out15.in	AC	17 ms	6 MB
g++	out2.in	AC	6 ms	4 MB
g++	out3.in	AC	6 ms	4 MB
g++	out4.in	AC	6 ms	4 MB
g++	out5.in	AC	6 ms	4 MB
g++	out6.in	AC	39 ms	10 MB
g++	out7.in	AC	40 ms	10 MB
g++	out8.in	AC	40 ms	10 MB
g++	out9.in	AC	40 ms	10 MB
clang++	00_sample1.in	AC	6 ms	4 MB
clang++	00_sample2.in	AC	6 ms	4 MB
clang++	critical1.in	AC	6 ms	4 MB
clang++	critical2.in	AC	8 ms	4 MB
clang++	critical3.in	AC	29 ms	8 MB
clang++	out1.in	AC	6 ms	4 MB
clang++	out10.in	AC	39 ms	10 MB
clang++	out11.in	AC	15 ms	6 MB
clang++	out12.in	AC	22 ms	7 MB
clang++	out13.in	AC	18 ms	6 MB
clang++	out14.in	AC	21 ms	6 MB
clang++	out15.in	AC	17 ms	6 MB
clang++	out2.in	AC	6 ms	4 MB
clang++	out3.in	AC	6 ms	4 MB
clang++	out4.in	AC	6 ms	4 MB
clang++	out5.in	AC	6 ms	4 MB
clang++	out6.in	AC	39 ms	10 MB
clang++	out7.in	AC	39 ms	10 MB
clang++	out8.in	AC	39 ms	10 MB
clang++	out9.in	AC	39 ms	10 MB

Back to top page