This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Two-Edge-Connected Components
#define PROBLEM "https://judge.yosupo.jp/problem/two_edge_connected_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 = two_edge_connected_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
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| g++ | example_00 |
|
5 ms | 4 MB |
| g++ | example_01 |
|
4 ms | 4 MB |
| g++ | example_02 |
|
5 ms | 3 MB |
| g++ | large_cycle_00 |
|
33 ms | 13 MB |
| g++ | max_random_00 |
|
71 ms | 17 MB |
| g++ | max_random_01 |
|
68 ms | 16 MB |
| g++ | max_random_02 |
|
68 ms | 16 MB |
| g++ | random_1_00 |
|
50 ms | 13 MB |
| g++ | random_1_01 |
|
55 ms | 13 MB |
| g++ | random_1_02 |
|
33 ms | 10 MB |
| g++ | random_2_00 |
|
19 ms | 6 MB |
| g++ | random_2_01 |
|
7 ms | 4 MB |
| g++ | random_2_02 |
|
26 ms | 8 MB |
| g++ | random_2_03 |
|
34 ms | 10 MB |
| g++ | random_2_04 |
|
16 ms | 5 MB |
| g++ | small_random_1_00 |
|
5 ms | 4 MB |
| g++ | small_random_1_01 |
|
4 ms | 4 MB |
| g++ | small_random_1_02 |
|
4 ms | 4 MB |
| g++ | small_random_2_00 |
|
5 ms | 4 MB |
| g++ | small_random_2_01 |
|
4 ms | 4 MB |
| g++ | small_random_2_02 |
|
4 ms | 4 MB |