test/cpv/library-checker-graph/two_edge_connected_components.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/two_edge_connected_components | ||
| 2 | #include "../../../src/graph/scc/e_bcc/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 21 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 21 times.
✗ Branch 3 not taken.
|
21 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | u32 n, m; | ||
| 8 |
2/4✓ Branch 1 taken 21 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 21 times.
✗ Branch 5 not taken.
|
21 | std::cin >> n >> m; |
| 9 | 21 | eog g(n); | |
| 10 |
2/2✓ Branch 0 taken 1537828 times.
✓ Branch 1 taken 21 times.
|
1537849 | for (u32 i = 0, u, v; i < m; ++i) { |
| 11 |
2/4✓ Branch 1 taken 1537828 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 1537828 times.
✗ Branch 5 not taken.
|
1537828 | std::cin >> u >> v; |
| 12 | 1537828 | g.add_edge(u, v); | |
| 13 | } | ||
| 14 | 21 | e_bcc bcc(g); | |
| 15 |
2/4✓ Branch 2 taken 21 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 21 times.
✗ Branch 6 not taken.
|
21 | std::cout << bcc.belongs.size() << '\n'; |
| 16 |
2/2✓ Branch 5 taken 452093 times.
✓ Branch 6 taken 21 times.
|
452114 | for (auto&& b : bcc.belongs) { |
| 17 |
3/4✓ Branch 2 taken 452093 times.
✗ Branch 3 not taken.
✓ Branch 9 taken 1149503 times.
✓ Branch 10 taken 452093 times.
|
1601596 | for (std::cout << b.size(); auto x : b) |
| 18 |
2/4✓ Branch 1 taken 1149503 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 1149503 times.
✗ Branch 5 not taken.
|
1149503 | std::cout << ' ' << x; |
| 19 |
1/2✓ Branch 1 taken 452093 times.
✗ Branch 2 not taken.
|
452093 | std::cout << '\n'; |
| 20 | } | ||
| 21 | 21 | return 0; | |
| 22 | 21 | } | |
| 23 |