Editorial for LCC '21 Contest 4 S5 - The End of Art Academy


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Author: BenZeng

Use a lazy segment tree and precompute the sum of all x^k from x=1 to x=N for all k from 0 to 10 to perform lazy updates in O(1).


Comments

There are no comments at the moment.