This documentation is automatically generated by competitive-verifier/competitive-verifier
// @brief Strongly Connected Components
#define PROBLEM "https://judge.yosupo.jp/problem/scc"
#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;
digraph g(n);
g.read_edges(m);
auto comps = strongly_connected_components(g);
cout << size(comps) << '\n';
for(auto const& comp: comps.rows() | views::reverse) {
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++ | large_cycle_00 |
|
101 ms | 25 MB |
| g++ | max_random_00 |
|
170 ms | 26 MB |
| g++ | max_random_01 |
|
156 ms | 26 MB |
| g++ | max_random_02 |
|
157 ms | 26 MB |
| g++ | max_random_03 |
|
156 ms | 26 MB |
| g++ | max_random_04 |
|
158 ms | 26 MB |
| g++ | random_00 |
|
129 ms | 23 MB |
| g++ | random_01 |
|
142 ms | 24 MB |
| g++ | random_02 |
|
61 ms | 13 MB |
| g++ | random_03 |
|
57 ms | 15 MB |
| g++ | random_04 |
|
55 ms | 14 MB |