test/cpv/library-checker-datastructure/staticrmq.st_array.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/staticrmq | ||
| 2 | #include "../../../src/ds/rmq/st/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 134705481 | i32 f(i32 x, i32 y) { return std::min(x, y); } | |
| 6 | |||
| 7 | 27 | int main() { | |
| 8 |
1/2✓ Branch 2 taken 27 times.
✗ Branch 3 not taken.
|
27 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 9 | u32 n, q; | ||
| 10 |
2/4✓ Branch 1 taken 27 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 27 times.
✗ Branch 5 not taken.
|
27 | std::cin >> n >> q; |
| 11 |
1/2✓ Branch 1 taken 27 times.
✗ Branch 2 not taken.
|
27 | veci a(n); |
| 12 |
3/4✓ Branch 2 taken 7112515 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 7112515 times.
✓ Branch 5 taken 27 times.
|
7112542 | flt_ (u32, i, 0, n) std::cin >> a[i]; |
| 13 | 27 | st_array<i32, f> st(a); | |
| 14 |
2/2✓ Branch 0 taken 6841143 times.
✓ Branch 1 taken 27 times.
|
6841170 | for (u32 i = 1, u, v; i <= q; ++i) { |
| 15 |
2/4✓ Branch 1 taken 6841143 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 6841143 times.
✗ Branch 5 not taken.
|
6841143 | std::cin >> u >> v; |
| 16 |
2/4✓ Branch 2 taken 6841143 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 6841143 times.
✗ Branch 6 not taken.
|
6841143 | std::cout << st.query(u, v) << '\n'; |
| 17 | } | ||
| 18 | 27 | return 0; | |
| 19 | 27 | } | |
| 20 |