test/cpv/library-checker-tree/cartesian_tree.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/cartesian_tree/ | ||
| 2 | #include "../../../src/ds/cartesian_tree/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 25 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 25 times.
✗ Branch 3 not taken.
|
25 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | u32 n; | ||
| 8 |
1/2✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
|
25 | std::cin >> n; |
| 9 |
1/2✓ Branch 1 taken 25 times.
✗ Branch 2 not taken.
|
25 | veci a(n); |
| 10 |
3/4✓ Branch 4 taken 9123472 times.
✗ Branch 5 not taken.
✓ Branch 8 taken 9123472 times.
✓ Branch 9 taken 25 times.
|
9123497 | for (auto& x : a) std::cin >> x; |
| 11 | 25 | cartesian_tree tr(a); | |
| 12 |
4/6✓ Branch 2 taken 9123472 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 9123472 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 9123472 times.
✓ Branch 8 taken 25 times.
|
9123497 | flt_ (u32, i, 0, n) std::cout << tr.t[i].fa << ' '; |
| 13 | 25 | return 0; | |
| 14 | 25 | } | |
| 15 |