Số bài đã giải: 295
Hạng điểm: #71
Tổng điểm:
156,63
Đóng góp:
17
Đã tham gia 4 kỳ thi
Hạng rating: #1
Rating:
Min. rating:
Max rating:
Từ Lớp C3 NC
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}}}})~
Huy hiệu
Người dùng này không có huy hiệu nào.Lịch sử rating
, #