test/cpv/aizu-dpl/dpl_1_d.youngt.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/7/DPL/all/DPL_1_D | ||
| 2 | #include "../../../src/math/ds/youngt/lib.hpp" | ||
| 3 | #include "../../../src/opt/lis/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 30 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 30 times.
✗ Branch 3 not taken.
|
30 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u32 n; | ||
| 9 |
1/2✓ Branch 1 taken 30 times.
✗ Branch 2 not taken.
|
30 | std::cin >> n; |
| 10 |
2/2✓ Branch 0 taken 8 times.
✓ Branch 1 taken 22 times.
|
30 | if (n > 10000) { |
| 11 |
1/2✓ Branch 1 taken 8 times.
✗ Branch 2 not taken.
|
8 | vecu v(n); |
| 12 |
3/4✓ Branch 4 taken 800000 times.
✗ Branch 5 not taken.
✓ Branch 8 taken 800000 times.
✓ Branch 9 taken 8 times.
|
800008 | for (auto& i : v) std::cin >> i; |
| 13 |
2/4✓ Branch 4 taken 8 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 8 times.
✗ Branch 8 not taken.
|
8 | std::cout << lis(v).size() << '\n'; |
| 14 | 8 | } else { | |
| 15 | 22 | Youngt yt; | |
| 16 |
2/2✓ Branch 0 taken 44286 times.
✓ Branch 1 taken 22 times.
|
44308 | for (u32 i = 0, x; i < n; ++i) { |
| 17 |
1/2✓ Branch 1 taken 44286 times.
✗ Branch 2 not taken.
|
44286 | std::cin >> x; |
| 18 | 44286 | yt.insert(x); | |
| 19 | } | ||
| 20 |
2/4✓ Branch 2 taken 22 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 22 times.
✗ Branch 6 not taken.
|
22 | std::cout << yt.width() << '\n'; |
| 21 | 22 | } | |
| 22 | 30 | return 0; | |
| 23 | } | ||
| 24 |