Do you know any problems that need fusion trees (even in theoretical cp)
I found only a wiki and some MIT lectures but not any good problems that needed it
As far as i know its some good hard but mostly theoretical thing (out of contests and cp material).
I know only 1 problem that needed it to get to O(1).
Any help would be wanted (especially from MIT cs students they must have done it).
I hope this helps. and this too.. Also this.
May as well note
1) it's misleading to call it hardest thing in cp, there are plenty of stuff harder.
2) Please use your real account, ejoi2019medal