test/cpv/library-checker-graph/directedmst.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/directedmst/ | ||
| 2 | #include "../../../src/graph/mst/cle/lib.hpp" | ||
| 3 | #include "../../../src/io/container/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 12 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 12 times.
✗ Branch 3 not taken.
|
12 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u32 n, m, s; | ||
| 9 |
3/6✓ Branch 1 taken 12 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 12 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 12 times.
✗ Branch 8 not taken.
|
12 | std::cin >> n >> m >> s; |
| 10 |
1/2✓ Branch 1 taken 12 times.
✗ Branch 2 not taken.
|
12 | vec<edge_t<u64>> arcs(m); |
| 11 |
5/8✓ Branch 4 taken 1794213 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 1794213 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 1794213 times.
✗ Branch 11 not taken.
✓ Branch 14 taken 1794213 times.
✓ Branch 15 taken 12 times.
|
1794225 | for (auto& [w, u, v] : arcs) std::cin >> u >> v >> w; |
| 12 | 12 | auto res = cle(n, s, arcs); | |
| 13 | |||
| 14 | 12 | u64 cost = 0; | |
| 15 |
1/2✓ Branch 2 taken 12 times.
✗ Branch 3 not taken.
|
12 | vecu ans(n, -1_u32); |
| 16 | 12 | ans[s] = s; | |
| 17 |
2/2✓ Branch 6 taken 1513531 times.
✓ Branch 7 taken 12 times.
|
1513543 | for (auto [w, u, v] : res) cost += w, ans[v] = u; |
| 18 |
1/2✓ Branch 1 taken 12 times.
✗ Branch 2 not taken.
|
12 | std::cout << cost << '\n' |
| 19 |
2/4✓ Branch 1 taken 12 times.
✗ Branch 2 not taken.
✓ Branch 5 taken 12 times.
✗ Branch 6 not taken.
|
12 | << ans << '\n'; |
| 20 | 12 | return 0; | |
| 21 | 12 | } | |
| 22 |