Minimum Spanning Tree (verify/graph/mst.test.cpp)

• View this file on GitHub
• Last update: 2026-04-22 09:17:08-07:00
• Problem: https://judge.yosupo.jp/problem/minimum_spanning_tree

Depends on

• cp-algo/graph/base.hpp
• cp-algo/graph/concepts.hpp
• cp-algo/graph/edge_types.hpp
• cp-algo/graph/mst.hpp
• cp-algo/structures/dsu.hpp
• cp-algo/structures/stack_union.hpp
• cp-algo/util/big_alloc.hpp
• cp-algo/util/bit.hpp
• cp-algo/util/simd.hpp
• cp-algo/util/sort.hpp

Code

// @brief Minimum Spanning Tree
#define PROBLEM "https://judge.yosupo.jp/problem/minimum_spanning_tree"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/graph/mst.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::graph;

void solve() {
    int n, m;
    cin >> n >> m;
    weighted_graph g(n);
    g.read_edges(m);
    auto [X, E] = mst(g);
    cout << X << "\n";
    for(int e: E) {cout << e << " ";}
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 290, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/languages/cplusplus.py", line 243, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/languages/cplusplus_bundle.py", line 322, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env	Name	Status	Elapsed	Memory
g++	complete_max_00	AC	104 ms	36 MB
g++	complete_max_01	AC	103 ms	36 MB
g++	complete_random_00	AC	3 ms	4 MB
g++	complete_random_01	AC	3 ms	4 MB
g++	complete_random_02	AC	4 ms	4 MB
g++	complete_random_03	AC	10 ms	5 MB
g++	complete_random_04	AC	31 ms	12 MB
g++	example_00	AC	2 ms	4 MB
g++	example_01	AC	2 ms	4 MB
g++	example_02	AC	2 ms	4 MB
g++	max_random_00	AC	171 ms	39 MB
g++	max_random_01	AC	176 ms	39 MB
g++	max_random_02	AC	174 ms	39 MB
g++	max_random_03	AC	173 ms	39 MB
g++	max_random_04	AC	173 ms	39 MB
g++	random_00	AC	143 ms	34 MB
g++	random_01	AC	171 ms	38 MB
g++	random_02	AC	116 ms	33 MB
g++	random_03	AC	162 ms	37 MB
g++	random_04	AC	134 ms	32 MB
g++	small_00	AC	97 ms	32 MB
g++	small_01	AC	103 ms	32 MB
g++	small_02	AC	89 ms	31 MB
g++	small_03	AC	9 ms	5 MB
g++	small_04	AC	27 ms	11 MB
g++	small_c01_00	AC	3 ms	4 MB
g++	small_c01_01	AC	2 ms	4 MB
g++	small_c01_02	AC	2 ms	4 MB
g++	small_c01_03	AC	2 ms	4 MB
g++	small_c01_04	AC	2 ms	4 MB
g++	star_00	AC	143 ms	39 MB

Back to top page