test/cpv/library-checker-datastructure/range_add_range_min.segtree-addmax.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/range_add_range_min | ||
| 2 | #include "../../../src/ds/segtree/ctor/lib.hpp" | ||
| 3 | #include "../../../src/io/container/lib.hpp" | ||
| 4 | #include "../../../src/util/traits/math/lib.hpp" | ||
| 5 | |||
| 6 | using namespace tifa_libs; | ||
| 7 | |||
| 8 | 23 | int main() { | |
| 9 |
1/2✓ Branch 2 taken 23 times.
✗ Branch 3 not taken.
|
23 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 10 | u32 n, q; | ||
| 11 |
2/4✓ Branch 1 taken 23 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 23 times.
✗ Branch 5 not taken.
|
23 | std::cin >> n >> q; |
| 12 |
1/2✓ Branch 1 taken 23 times.
✗ Branch 2 not taken.
|
23 | vecii a(n); |
| 13 | 23 | std::cin >> a; | |
| 14 |
2/2✓ Branch 5 taken 4639492 times.
✓ Branch 6 taken 23 times.
|
4639515 | for (auto& i : a) i = -i; |
| 15 | 23 | auto tr = segtl_addmax_ctor<i64>(-inf_v<i64>, a); | |
| 16 |
2/2✓ Branch 0 taken 4842217 times.
✓ Branch 1 taken 23 times.
|
4842240 | flt_ (u32, i, 0, q) { |
| 17 | u32 op, u, v; | ||
| 18 | i64 w; | ||
| 19 |
3/6✓ Branch 1 taken 4842217 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 4842217 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 4842217 times.
✗ Branch 8 not taken.
|
4842217 | std::cin >> op >> u >> v; |
| 20 |
4/6✓ Branch 0 taken 2421751 times.
✓ Branch 1 taken 2420466 times.
✓ Branch 4 taken 2421751 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 2421751 times.
✗ Branch 8 not taken.
|
4842217 | if (op) std::cout << -tr.query(u, v) << '\n'; |
| 21 |
1/2✓ Branch 1 taken 2420466 times.
✗ Branch 2 not taken.
|
2420466 | else (std::cin >> w), tr.update(u, v, -w); |
| 22 | } | ||
| 23 | 23 | return 0; | |
| 24 | 23 | } | |
| 25 |