Asia East, China, Beihang University, Serval, Oshwiciqwqq, 200815147

Sorry for trouble caused.

In problem D2, we think that the space complexity $$$O(n\log n)$$$ isn't that large when $$$n\le 10^5$$$. My submission only uses 26700KB and among all the testers the largest memory usage is 89200KB. So we just set a standard 256MB memory limit.

As for problem E, we didn't expect that it would be a trivial problem. That's why we say 'Sorry for my mistake in estimating the difficulty of problem D2 and E.' in the previous blog.

As a coauther & tester for the first time, I hope you enjoy this round!