test/cpv/library-checker-graph/cycle_detection_undirected.hash-splitmix64.hashmap-pbds_cc_hmap.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | #define AUTO_GENERATED | ||
| 2 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cycle_detection_undirected | ||
| 3 | #include "../../../src/graph/ds/alist/lib.hpp" | ||
| 4 | #include "../../../src/graph/find_cycle/lib.hpp" | ||
| 5 | // | ||
| 6 | #include "../../../src/edh/splitmix64/lib.hpp" | ||
| 7 | |||
| 8 | using namespace tifa_libs; | ||
| 9 | template <class> | ||
| 10 | using hashfunc_t = hash_splitmix64; | ||
| 11 | using namespace tifa_libs; | ||
| 12 | template <class K, class V> | ||
| 13 | using hashmap = __gnu_pbds::cc_hash_table<K, V, std::conditional_t<std::is_void_v<hashfunc_t<K>>, TPN __gnu_pbds::detail::default_hash_fn<K>::type, hashfunc_t<K>>>; | ||
| 14 | |||
| 15 | 27 | int main() { | |
| 16 |
1/2✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
|
27 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 17 | u32 n, m; | ||
| 18 |
2/4✓ Branch 1 taken 27 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 27 times.
✗ Branch 5 not taken.
|
27 | std::cin >> n >> m; |
| 19 | 27 | tifa_libs::alist g(n); | |
| 20 |
1/2✓ Branch 1 taken 27 times.
✗ Branch 2 not taken.
|
27 | hashmap<pttu, u32> edges; |
| 21 |
2/2✓ Branch 0 taken 3618113 times.
✓ Branch 1 taken 16 times.
|
3618129 | for (u32 i = 0, u, v; i < m; ++i) { |
| 22 |
2/4✓ Branch 1 taken 3618113 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 3618113 times.
✗ Branch 5 not taken.
|
3618113 | std::cin >> u >> v; |
| 23 |
2/2✓ Branch 0 taken 7 times.
✓ Branch 1 taken 3618106 times.
|
3618113 | if (u == v) { |
| 24 |
1/2✓ Branch 1 taken 7 times.
✗ Branch 2 not taken.
|
7 | std::cout << "1\n" |
| 25 |
2/4✓ Branch 1 taken 7 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 7 times.
✗ Branch 5 not taken.
|
7 | << u << '\n' |
| 26 |
2/4✓ Branch 1 taken 7 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 7 times.
✗ Branch 5 not taken.
|
7 | << i << '\n'; |
| 27 | 11 | return 0; | |
| 28 | } | ||
| 29 |
3/4✓ Branch 2 taken 3618106 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 4 times.
✓ Branch 5 taken 3618102 times.
|
3618106 | if (edges[{u, v}]) { |
| 30 |
1/2✓ Branch 1 taken 4 times.
✗ Branch 2 not taken.
|
4 | std::cout << "2\n" |
| 31 |
4/8✓ Branch 1 taken 4 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 4 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 4 times.
✗ Branch 11 not taken.
|
4 | << u << ' ' << v << '\n' |
| 32 |
5/10✓ Branch 1 taken 4 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4 times.
✗ Branch 5 not taken.
✓ Branch 8 taken 4 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 4 times.
✗ Branch 12 not taken.
✓ Branch 14 taken 4 times.
✗ Branch 15 not taken.
|
4 | << i << ' ' << edges[{u, v}] - 1 << '\n'; |
| 33 | 4 | return 0; | |
| 34 | } | ||
| 35 |
2/4✓ Branch 2 taken 3618102 times.
✗ Branch 3 not taken.
✓ Branch 6 taken 3618102 times.
✗ Branch 7 not taken.
|
3618102 | edges[{u, v}] = edges[{v, u}] = i + 1; |
| 36 | 3618102 | g.add_arc(u, v); | |
| 37 | 3618102 | g.add_arc(v, u); | |
| 38 | } | ||
| 39 | 16 | auto res = tifa_libs::find_cycle<false>(g); | |
| 40 |
2/2✓ Branch 1 taken 8 times.
✓ Branch 2 taken 8 times.
|
16 | if (res.empty()) { |
| 41 |
1/2✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
|
8 | std::cout << "-1\n"; |
| 42 | 8 | return 0; | |
| 43 | } | ||
| 44 |
2/4✓ Branch 2 taken 8 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 8 times.
✗ Branch 6 not taken.
|
8 | std::cout << res.size() << '\n'; |
| 45 |
4/6✓ Branch 3 taken 489899 times.
✗ Branch 4 not taken.
✓ Branch 7 taken 489899 times.
✗ Branch 8 not taken.
✓ Branch 9 taken 489899 times.
✓ Branch 10 taken 8 times.
|
489907 | flt_ (u32, i, 0, (u32)res.size()) std::cout << res[i].first << " \n"[i + 1 == res.size()]; |
| 46 |
5/8✓ Branch 3 taken 489899 times.
✗ Branch 4 not taken.
✓ Branch 6 taken 489899 times.
✗ Branch 7 not taken.
✓ Branch 10 taken 489899 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 489899 times.
✓ Branch 13 taken 8 times.
|
489907 | flt_ (u32, i, 0, (u32)res.size()) std::cout << edges[res[i]] - 1 << " \n"[i + 1 == res.size()]; |
| 47 | 8 | return 0; | |
| 48 | 27 | } | |
| 49 |