test/cpv/library-checker-graph/minimum_steiner_tree.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/minimum_steiner_tree/ | ||
| 2 | #include "../../../src/graph/ds/alist/lib.hpp" | ||
| 3 | #include "../../../src/graph/mst/steiner/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 24 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 24 times.
✗ Branch 3 not taken.
|
24 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u32 n, m; | ||
| 9 |
2/4✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 24 times.
✗ Branch 5 not taken.
|
24 | std::cin >> n >> m; |
| 10 | 24 | alist<u64> e(n); | |
| 11 | 24 | std::map<pttu, pttu> id; | |
| 12 |
2/2✓ Branch 0 taken 15077 times.
✓ Branch 1 taken 24 times.
|
15101 | for (u32 i = 0, u, v, w; i < m; ++i) { |
| 13 |
3/6✓ Branch 1 taken 15077 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 15077 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 15077 times.
✗ Branch 8 not taken.
|
15077 | std::cin >> u >> v >> w, e.add_arc(u, v, w), e.add_arc(v, u, w); |
| 14 |
9/12✓ Branch 3 taken 15077 times.
✗ Branch 4 not taken.
✓ Branch 5 taken 2630 times.
✓ Branch 6 taken 12447 times.
✓ Branch 9 taken 2630 times.
✗ Branch 10 not taken.
✓ Branch 11 taken 847 times.
✓ Branch 12 taken 1783 times.
✓ Branch 13 taken 13294 times.
✓ Branch 14 taken 1783 times.
✓ Branch 18 taken 13294 times.
✗ Branch 19 not taken.
|
15077 | if (auto p = std::minmax(u, v); id[p].first == 0 || id[p].first > w) id[p] = {w, i}; |
| 15 | } | ||
| 16 | u32 k; | ||
| 17 |
1/2✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
|
24 | std::cin >> k; |
| 18 |
1/2✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
|
24 | vecu a(k); |
| 19 |
3/4✓ Branch 4 taken 178 times.
✗ Branch 5 not taken.
✓ Branch 8 taken 178 times.
✓ Branch 9 taken 24 times.
|
202 | for (auto& x : a) std::cin >> x; |
| 20 | 24 | auto [sum, edges] = steiner_tree<true>(e, a); | |
| 21 |
4/8✓ Branch 1 taken 24 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 24 times.
✗ Branch 5 not taken.
✓ Branch 8 taken 24 times.
✗ Branch 9 not taken.
✓ Branch 11 taken 24 times.
✗ Branch 12 not taken.
|
24 | std::cout << sum << ' ' << edges.size() << '\n'; |
| 22 |
5/8✓ Branch 3 taken 297 times.
✗ Branch 4 not taken.
✓ Branch 6 taken 297 times.
✗ Branch 7 not taken.
✓ Branch 10 taken 297 times.
✗ Branch 11 not taken.
✓ Branch 12 taken 297 times.
✓ Branch 13 taken 24 times.
|
321 | flt_ (u32, i, 0, (u32)edges.size()) std::cout << id[edges[i]].second << " \n"[i == edges.size() - 1]; |
| 23 | 24 | return 0; | |
| 24 | 24 | } | |
| 25 |