test/cpv/aizu-alds1/alds1_7_d.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/1/ALDS1/all/ALDS1_7_D | ||
| 2 | #include "../../../src/io/container/lib.hpp" | ||
| 3 | #include "../../../src/tree/btree_make_post_pi/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 20 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 20 times.
✗ Branch 3 not taken.
|
20 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u32 n; | ||
| 9 |
1/2✓ Branch 1 taken 20 times.
✗ Branch 2 not taken.
|
20 | std::cin >> n; |
| 10 |
2/4✓ Branch 1 taken 20 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 20 times.
✗ Branch 5 not taken.
|
60 | vecu a(n), b(n); |
| 11 | 20 | std::cin >> a >> b; | |
| 12 |
1/2✓ Branch 5 taken 20 times.
✗ Branch 6 not taken.
|
20 | std::cout << btree_make_post_pi(a, b) << '\n'; |
| 13 | 20 | return 0; | |
| 14 | 20 | } | |
| 15 |