test/cpv/library-checker-tree/dynamic_tree_vertex_add_subtree_sum.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/dynamic_tree_vertex_add_subtree_sum/ | ||
| 2 | #include "../../../src/ds/link_cut_tree/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 833449144 | auto op(u64 a, u64 b) { return a + b; } | |
| 6 | 32209624 | auto inv_op(u64 a, u64 b) { return a - b; } | |
| 7 | |||
| 8 | 18 | int main() { | |
| 9 |
1/2✓ Branch 2 taken 18 times.
✗ Branch 3 not taken.
|
18 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 10 | u32 n, m; | ||
| 11 |
2/4✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 18 times.
✗ Branch 5 not taken.
|
18 | std::cin >> n >> m; |
| 12 |
1/2✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
|
18 | vecuu a(n); |
| 13 |
3/4✓ Branch 4 taken 1918537 times.
✗ Branch 5 not taken.
✓ Branch 8 taken 1918537 times.
✓ Branch 9 taken 18 times.
|
1918555 | for (auto& x : a) std::cin >> x; |
| 14 |
1/2✓ Branch 1 taken 18 times.
✗ Branch 2 not taken.
|
18 | link_cut_tree<u64, op, inv_op> lct(n, a); |
| 15 |
4/6✓ Branch 1 taken 1918519 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 1918519 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 1918519 times.
✓ Branch 8 taken 18 times.
|
1918537 | for (u32 i = 1, u, v; i < n; ++i) std::cin >> u >> v, lct.link(u, v); |
| 16 |
2/2✓ Branch 0 taken 1947399 times.
✓ Branch 1 taken 18 times.
|
1947417 | flt_ (u32, i, 0, m) { |
| 17 | u32 opt, u, v; | ||
| 18 |
3/6✓ Branch 1 taken 1947399 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 1947399 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 1947399 times.
✗ Branch 8 not taken.
|
1947399 | std::cin >> opt >> u >> v; |
| 19 |
2/2✓ Branch 0 taken 650106 times.
✓ Branch 1 taken 1297293 times.
|
1947399 | if (opt == 0) { |
| 20 | u32 p, q; | ||
| 21 |
2/4✓ Branch 1 taken 650106 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 650106 times.
✗ Branch 5 not taken.
|
650106 | std::cin >> p >> q; |
| 22 | 650106 | lct.cut(u, v), lct.link(p, q); | |
| 23 |
2/2✓ Branch 0 taken 648681 times.
✓ Branch 1 taken 648612 times.
|
1297293 | } else if (opt == 1) lct.node_add(u, v); |
| 24 |
2/4✓ Branch 2 taken 648612 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 648612 times.
✗ Branch 6 not taken.
|
648612 | else std::cout << lct.query_subtree(u, v).first << '\n'; |
| 25 | } | ||
| 26 | 18 | return 0; | |
| 27 | 18 | } | |
| 28 |