test/cpv/aizu-info1/info1_12_d.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/lesson/9/INFO1/all/INFO1_12_D | ||
| 2 | #include "../../../src/ds/fenwick/d2/lib.hpp" | ||
| 3 | |||
| 4 | using namespace tifa_libs; | ||
| 5 | 10 | int main() { | |
| 6 |
1/2✓ Branch 2 taken 10 times.
✗ Branch 3 not taken.
|
10 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 7 | u32 n, m, q; | ||
| 8 |
3/6✓ Branch 1 taken 10 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 10 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 10 times.
✗ Branch 8 not taken.
|
10 | std::cin >> n >> m >> q; |
| 9 | 10 | fenwick2d<i32> tr(n + 3, m + 3); | |
| 10 |
2/2✓ Branch 0 taken 665 times.
✓ Branch 1 taken 10 times.
|
675 | for (u32 i = 0, a, b, c, d; i < q; ++i) { |
| 11 |
4/8✓ Branch 1 taken 665 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 665 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 665 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 665 times.
✗ Branch 11 not taken.
|
665 | std::cin >> a >> b >> c >> d; |
| 12 | 665 | tr.add(a + 1, b + 1, c + 2, d + 2, 1); | |
| 13 | } | ||
| 14 |
2/2✓ Branch 0 taken 243 times.
✓ Branch 1 taken 10 times.
|
253 | flt_ (u32, i, 1, n + 1) |
| 15 |
4/6✓ Branch 2 taken 20654 times.
✗ Branch 3 not taken.
✓ Branch 5 taken 20654 times.
✗ Branch 6 not taken.
✓ Branch 7 taken 20654 times.
✓ Branch 8 taken 243 times.
|
20897 | flt_ (u32, j, 1, m + 1) std::cout << tr.sum(i, j) << " \n"[j == m]; |
| 16 | 10 | return 0; | |
| 17 | 10 | } | |
| 18 |