Số bài đã giải: 303
Hạng điểm: #94
Tổng điểm:
161,30
Đóng góp:
15
Đã tham gia 6 kỳ thi
Hạng rating: #1
Rating:
Min. rating:
Max rating:
Thông tin
CF:
954I unintended solution (run faster than most FFT solutions!, possible bitset WR?)
914F unintended solution (world record run!!!)
1440E unintended solution (run as fast as implementations of ~O(nlog^2(n))~ with an extra ~log~!)
2055C unintended solution (shows how "The naive solution of writing out a linear system and solving them will take ~O((n+m)^3)~
time, which is too slow, so we will need a faster algorithm." can be disproven using a few simple tricks. Note: The problem is extremely I/O bottlenecked and the compute time is barely anything w.r.t the running time.)
SQRT DECOMP IS MY LIFE !!!
~d(n) = O(n^{\frac{\ln{2}}{\ln{\ln{n}}}})~
| ANDXOR (Bitwise RARS) | |
|---|---|
| Method | RT |
| Recursive RARS | >2.0s |
| Iterative RARS | 1.8s |
| Iterative RARS with masking | 0.6s |
| Iterative RARS with masking+integer packing | 0.6s w pragma, 1.4s otherwise |
| Iterative RARS with masking+YMM+Pragma+FastIO | 0.53s |
| Iterative RARS with parallel integer packing + Pragma + FastIO | 0.42s |
| Sqrt Decomposition RARS with parallel integer packing + Pragma + FastIO, block size = 128 | 0.33s |
| Sqrt Decomposition RARS with parallel integer packing + Pragma + FastIO, block size = 128, with aligned p array | 0.21s |
| Sqrt Decomposition RARS with parallel integer packing + Pragma + FastIO, block size = 256, with aligned p and lazy array | 0.19s |
- RARS: Range Affine Range Sum
Huy hiệu
Người dùng này không có huy hiệu nào.Lịch sử rating
, #