test/cpv/aizu-dsl/dsl_3_d.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_3_D | ||
| 2 | #include "../../../src/ds/mono_queue/lib.hpp" | ||
| 3 | #include "../../../src/util/alias/others/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | 42 | int main() { | |
| 7 |
1/2✓ Branch 2 taken 42 times.
✗ Branch 3 not taken.
|
42 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 8 | u32 n, k; | ||
| 9 |
2/4✓ Branch 1 taken 42 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 42 times.
✗ Branch 5 not taken.
|
42 | std::cin >> n >> k; |
| 10 | 42 | mono_queue<i32> qmin(k); | |
| 11 | 42 | veci ans; | |
| 12 |
1/2✓ Branch 1 taken 42 times.
✗ Branch 2 not taken.
|
42 | ans.reserve(n); |
| 13 |
2/2✓ Branch 0 taken 18428285 times.
✓ Branch 1 taken 42 times.
|
18428327 | flt_ (u32, i, 0, n) { |
| 14 | i32 x; | ||
| 15 |
1/2✓ Branch 1 taken 18428285 times.
✗ Branch 2 not taken.
|
18428285 | std::cin >> x; |
| 16 |
1/2✓ Branch 2 taken 18428285 times.
✗ Branch 3 not taken.
|
18428285 | ans.push_back(qmin.push(x)); |
| 17 | } | ||
| 18 |
4/6✓ Branch 2 taken 18160858 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 18160858 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 18160858 times.
✓ Branch 8 taken 42 times.
|
18160900 | flt_ (u32, i, k - 1, n) std::cout << ans[i] << " \n"[i + 1 == n]; |
| 19 | 42 | } | |
| 20 |