test/cpv/library-checker-graph/bipartitematching.hopkap.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/bipartitematching | ||
| 2 | #include "../../../src/graph/nf/hopkap/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 44 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 44 times.
✗ Branch 3 not taken.
|
44 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | u32 l, r, m; | ||
| 8 |
3/6✓ Branch 1 taken 44 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 44 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 44 times.
✗ Branch 8 not taken.
|
44 | std::cin >> l >> r >> m; |
| 9 |
1/2✓ Branch 1 taken 44 times.
✗ Branch 2 not taken.
|
44 | vecptu edges(m); |
| 10 |
4/6✓ Branch 6 taken 7273057 times.
✗ Branch 7 not taken.
✓ Branch 9 taken 7273057 times.
✗ Branch 10 not taken.
✓ Branch 13 taken 7273057 times.
✓ Branch 14 taken 44 times.
|
7273101 | for (auto& [u, v] : edges) std::cin >> u >> v; |
| 11 | 44 | auto ans = hopkap(l, r, edges); | |
| 12 |
2/4✓ Branch 2 taken 44 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 44 times.
✗ Branch 6 not taken.
|
44 | std::cout << ans.size() << '\n'; |
| 13 |
6/10✓ Branch 6 taken 2438455 times.
✗ Branch 7 not taken.
✓ Branch 9 taken 2438455 times.
✗ Branch 10 not taken.
✓ Branch 12 taken 2438455 times.
✗ Branch 13 not taken.
✓ Branch 15 taken 2438455 times.
✗ Branch 16 not taken.
✓ Branch 19 taken 2438455 times.
✓ Branch 20 taken 44 times.
|
2438499 | for (auto [u, v] : ans) std::cout << u << ' ' << v << '\n'; |
| 14 | 44 | return 0; | |
| 15 | 44 | } | |
| 16 |