Biconnected Components (verify/graph/bcc.test.cpp)

• View this file on GitHub
• Last update: 2025-12-12 22:29:00+01:00
• Problem: https://judge.yosupo.jp/problem/biconnected_components

Depends on

• cp-algo/graph/base.hpp
• cp-algo/graph/concepts.hpp
• cp-algo/graph/dfs.hpp
• cp-algo/graph/dfs_time.hpp
• cp-algo/graph/edge_types.hpp
• cp-algo/graph/tarjan.hpp
• cp-algo/structures/csr.hpp
• cp-algo/structures/stack_union.hpp
• cp-algo/util/big_alloc.hpp

Code

// @brief Biconnected Components
#define PROBLEM "https://judge.yosupo.jp/problem/biconnected_components"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include <iostream>
//#include "blazingio/blazingio.min.hpp"
#include "cp-algo/graph/tarjan.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::graph;

void solve() {
    int n, m;
    cin >> n >> m;
    graph g(n);
    g.read_edges(m);
    auto comps = biconnected_components(g);
    cout << size(comps) << '\n';
    for(auto const& comp: comps.rows()) {
        cout << size(comp) << ' ';
        for(auto v: comp) {
            cout << v << ' ';
        }
        cout << '\n';
    }
}

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_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	5 ms	4 MB
g++	example_01	AC	4 ms	4 MB
g++	example_02	AC	4 ms	4 MB
g++	large_cycle_00	AC	204 ms	45 MB
g++	max_line_clique_00	AC	121 ms	32 MB
g++	max_random_00	AC	216 ms	40 MB
g++	max_random_2_00	AC	219 ms	36 MB
g++	max_random_2_01	AC	250 ms	36 MB
g++	max_random_2_02	AC	256 ms	36 MB
g++	max_star_00	AC	167 ms	36 MB
g++	max_tree_00	AC	208 ms	36 MB
g++	min_00	AC	4 ms	4 MB
g++	min_01	AC	4 ms	4 MB
g++	min_02	AC	4 ms	4 MB
g++	random_1_00	AC	180 ms	32 MB
g++	random_2_00	AC	194 ms	33 MB
g++	random_2_01	AC	102 ms	26 MB
g++	random_2_02	AC	91 ms	23 MB
g++	small_random_1_00	AC	4 ms	4 MB
g++	small_random_2_00	AC	4 ms	4 MB
g++	small_random_2_01	AC	4 ms	4 MB
g++	small_random_2_02	AC	4 ms	4 MB

Back to top page