test/cpv/library-checker-graph/dominatortree.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/dominatortree/ | ||
| 2 | #include "../../../src/graph/domtree/lib.hpp" | ||
| 3 | #include "../../../src/graph/ds/alist/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 13 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 13 times.
✗ Branch 3 not taken.
|
13 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u32 n, m, s; | ||
| 9 |
3/6✓ Branch 1 taken 13 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 13 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 13 times.
✗ Branch 8 not taken.
|
13 | std::cin >> n >> m >> s; |
| 10 | 13 | alist g(n); | |
| 11 |
2/2✓ Branch 0 taken 1419802 times.
✓ Branch 1 taken 13 times.
|
1419815 | for (u32 i = 0, u, v; i < m; ++i) { |
| 12 |
2/4✓ Branch 1 taken 1419802 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 1419802 times.
✗ Branch 5 not taken.
|
1419802 | std::cin >> u >> v; |
| 13 | 1419802 | g.add_arc(u, v); | |
| 14 | } | ||
| 15 | 13 | domtree dt(g); | |
| 16 | 13 | auto res = dt.get_domtree(s); | |
| 17 |
4/6✓ Branch 2 taken 1113754 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 1113754 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 1113754 times.
✓ Branch 8 taken 13 times.
|
1113767 | flt_ (u32, i, 0, n) std::cout << (i32)res[i] << " \n"[i == n - 1]; |
| 18 | 13 | return 0; | |
| 19 | 13 | } | |
| 20 |