https://en.algorithmica.org/hpc/data-structures/s-tree/
I announced this article a while ago but finally got to finish it just now.
Planned follow-ups: a 10-20x faster segment tree, std::priority_queue
, and std::set
.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
https://en.algorithmica.org/hpc/data-structures/s-tree/
I announced this article a while ago but finally got to finish it just now.
Planned follow-ups: a 10-20x faster segment tree, std::priority_queue
, and std::set
.
Name |
---|
Those are some great numbers! While I'm yet to try out the magic of SIMD, I did have a question. As the adoption of SIMD replacements becomes more popular, and I hope it does- What impact on the adoption of slower languages like Java/Python do you foresee as setters would also have to account for the change and allocating lax TLs to ensure that ideal solutions in other languages do pass would probably end up with suboptimal C++ solutions making it too. Basically, the language gap would be exacerbated. To clarify, I'm not complaining, I'm excited about the change, just curious about your views on the impact.