This documentation is automatically generated by competitive-verifier/competitive-verifier
// competitive-verifier: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_2_A
#include "../../template/template.hpp"
#include "../../graph/mst/prim-fibonacchi-heap.hpp"
int main() {
int V, E;
cin >> V >> E;
Graph<> g(V);
g.read(E, 0, true);
cout << prim_fibonacchi_heap(g).cost << "\n";
}
#line 1 "test/verify/aoj-grl-2-a-4.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>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
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(std::forward<F>(f)) {}
template <typename... Args>
decltype(auto) operator()(Args &&...args) const {
return F::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename F>
inline decltype(auto) MFP(F &&f) {
return FixPoint<F>{std::forward<F>(f)};
}
#line 4 "test/verify/aoj-grl-2-a-4.test.cpp"
#line 2 "graph/mst/prim-fibonacchi-heap.hpp"
#line 1 "structure/heap/fibonacchi-heap.hpp"
/**
* @brief Fibonacchi-Heap(フィボナッチヒープ)
* @see https://www.cs.princeton.edu/~wayne/teaching/fibonacci-heap.pdf
*/
template <typename key_t, typename val_t>
struct FibonacchiHeap {
struct Node {
key_t key;
val_t val;
Node *left, *right, *child, *par;
int sz;
bool mark;
Node(const key_t &key, const val_t &val)
: key(key),
val(val),
left(this),
right(this),
par(nullptr),
child(nullptr),
sz(0),
mark(false) {}
};
Node *root;
size_t sz;
vector<Node *> rank;
FibonacchiHeap() : root(nullptr), sz(0) {}
size_t size() const { return sz; }
bool empty() const { return sz == 0; }
void update_min(Node *t) {
if (!root || t->key < root->key) {
root = t;
}
}
void concat(Node *&r, Node *t) {
if (!r) {
r = t;
} else {
t->left->right = r->right;
r->right->left = t->left;
t->left = r;
r->right = t;
}
}
void delete_node(Node *t) {
t->left->right = t->right;
t->right->left = t->left;
t->left = t;
t->right = t;
}
Node *push(const key_t &key, const val_t &val) {
++sz;
auto node = new Node(key, val);
concat(root, node);
update_min(node);
return node;
}
Node *consolidate(Node *s, Node *t) {
if (root == s || s->key < t->key) {
delete_node(t);
++s->sz;
t->par = s;
concat(s->child, t);
return s;
} else {
delete_node(s);
++t->sz;
s->par = t;
concat(t->child, s);
return t;
}
}
pair<key_t, val_t> pop() {
--sz;
Node *rem = root;
auto ret = make_pair(rem->key, rem->val);
{
root = root->left == root ? nullptr : root->left;
delete_node(rem);
}
if (rem->child) {
concat(root, rem->child);
}
if (root) {
{
Node *base = root, *cur = base;
do {
cur->par = nullptr;
update_min(cur);
cur = cur->right;
} while (cur != base);
}
{
Node *base = root;
int last = -1;
do {
Node *nxt = base->right;
while (base->sz < rank.size() && rank[base->sz]) {
Node *u = rank[base->sz];
rank[base->sz] = nullptr;
base = consolidate(u, base);
}
if (base->sz >= rank.size()) rank.resize(base->sz + 1);
last = max(last, base->sz);
rank[base->sz] = base;
base = nxt;
} while (base != root);
for (int i = last; i >= 0; i--) rank[i] = nullptr;
}
}
return ret;
}
inline void mark_dfs(Node *t) {
if (!t->par) {
t->mark = false;
} else if (t->mark) {
mark_dfs(t->par);
t->par->child = t->left == t ? nullptr : t->left;
delete_node(t);
t->sz--;
t->mark = false;
t->par = nullptr;
concat(root, t);
} else {
t->mark = true;
t->sz--;
}
}
void decrease_key(Node *t, const key_t &d) {
t->key -= d;
if (!t->par) {
update_min(t);
return;
}
if (t->par->key <= t->key) {
return;
}
t->sz++;
t->mark = true;
mark_dfs(t);
update_min(t);
}
};
#line 2 "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 {
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 5 "graph/mst/prim-fibonacchi-heap.hpp"
/**
* @brief Prim Fibonacchi Heap(最小全域木)
*
*/
template <typename T>
struct MinimumSpanningTree {
T cost;
Edges<T> edges;
};
template <typename T>
MinimumSpanningTree<T> prim_fibonacchi_heap(Graph<T> &g) {
using Heap = FibonacchiHeap<T, int>;
using Node = typename Heap::Node;
T total = 0;
vector<Edge<T> *> dist(g.size());
vector<int> used(g.size());
Heap heap;
vector<Node *> keep(g.size(), nullptr);
keep[0] = heap.push(0, 0);
Edges<T> es;
while (!heap.empty()) {
T cost;
int idx;
tie(cost, idx) = heap.pop();
if (used[idx]) continue;
used[idx] = true;
total += cost;
if (dist[idx]) es.emplace_back(*dist[idx]);
for (auto &e : g[idx]) {
if (used[e.to] || (dist[e.to] && dist[e.to]->cost <= e.cost)) continue;
if (keep[e.to] == nullptr) {
dist[e.to] = &e;
keep[e.to] = heap.push(e.cost, e.to);
} else {
T d = dist[e.to]->cost - e.cost;
heap.decrease_key(keep[e.to], d);
dist[e.to] = &e;
}
}
}
return {total, es};
}
#line 6 "test/verify/aoj-grl-2-a-4.test.cpp"
int main() {
int V, E;
cin >> V >> E;
Graph<> g(V);
g.read(E, 0, true);
cout << prim_fibonacchi_heap(g).cost << "\n";
}
Env | Name | Status | Elapsed | Memory |
---|---|---|---|---|
g++ | 00_sample1.in |
![]() |
7 ms | 3 MB |
g++ | 00_sample2.in |
![]() |
6 ms | 3 MB |
g++ | critical1.in |
![]() |
6 ms | 3 MB |
g++ | critical2.in |
![]() |
9 ms | 5 MB |
g++ | critical3.in |
![]() |
20 ms | 7 MB |
g++ | out1.in |
![]() |
7 ms | 3 MB |
g++ | out10.in |
![]() |
33 ms | 9 MB |
g++ | out11.in |
![]() |
14 ms | 5 MB |
g++ | out12.in |
![]() |
18 ms | 6 MB |
g++ | out13.in |
![]() |
15 ms | 6 MB |
g++ | out14.in |
![]() |
18 ms | 6 MB |
g++ | out15.in |
![]() |
18 ms | 6 MB |
g++ | out2.in |
![]() |
7 ms | 3 MB |
g++ | out3.in |
![]() |
6 ms | 3 MB |
g++ | out4.in |
![]() |
6 ms | 3 MB |
g++ | out5.in |
![]() |
6 ms | 3 MB |
g++ | out6.in |
![]() |
33 ms | 9 MB |
g++ | out7.in |
![]() |
34 ms | 9 MB |
g++ | out8.in |
![]() |
33 ms | 9 MB |
g++ | out9.in |
![]() |
33 ms | 9 MB |
clang++ | 00_sample1.in |
![]() |
6 ms | 3 MB |
clang++ | 00_sample2.in |
![]() |
6 ms | 3 MB |
clang++ | critical1.in |
![]() |
6 ms | 3 MB |
clang++ | critical2.in |
![]() |
9 ms | 5 MB |
clang++ | critical3.in |
![]() |
21 ms | 7 MB |
clang++ | out1.in |
![]() |
7 ms | 3 MB |
clang++ | out10.in |
![]() |
33 ms | 9 MB |
clang++ | out11.in |
![]() |
14 ms | 5 MB |
clang++ | out12.in |
![]() |
18 ms | 6 MB |
clang++ | out13.in |
![]() |
16 ms | 6 MB |
clang++ | out14.in |
![]() |
18 ms | 6 MB |
clang++ | out15.in |
![]() |
18 ms | 6 MB |
clang++ | out2.in |
![]() |
7 ms | 3 MB |
clang++ | out3.in |
![]() |
6 ms | 3 MB |
clang++ | out4.in |
![]() |
7 ms | 3 MB |
clang++ | out5.in |
![]() |
7 ms | 3 MB |
clang++ | out6.in |
![]() |
34 ms | 9 MB |
clang++ | out7.in |
![]() |
33 ms | 9 MB |
clang++ | out8.in |
![]() |
43 ms | 9 MB |
clang++ | out9.in |
![]() |
33 ms | 9 MB |