Andrew He

Quick question: do you support infinite intersections? That may or may not be good to include.

Sure, good solution. I remember Gennady had some code that supported it, but bounding box works fine.

Hello! Here's my take on which of these are good to include > Replaced/duplicate implementations > > * [ ] New Link Cut Tree implementation They're probably about the same,...

re: LCT, ours supports BBST=-like augmentation, so it can fully replace HLD. Maybe consider removing the HLD?

In our book, our rough heuristic is one hash per function, and the preprocessor defaults to single hash per code unless otherwise specified. From a contestant's point of view, hashes...

Oh whoops didn't see your comment. Anyways, here's some misc changes that you probably don't want to miss.

The performance differences probably all arise from doing twice as many fft's in inverse.

Do you handle `pow(*, 0)` correctly?

You may want to document various assumptions later. Off the top of my head: - `inverse` expects `a[0] != 0` - `log` expects `a[0] == 1` - `exp` expects `a[0]...

I suspect you can get some reasonable gains on small cases by resuing the `rt` and `rev` arrays (store globally). I'm not a huge fan of having `naive_mul` both on...