Hello,Can you give me any hints?I've tried to do it with O(log(s)^2) on each query (s is the number of starships used), but TLE As I've seen it worked for ~7.6, time limit is 7...Help me, please, to help R2-D2 Thanks!
I have queried in log(n) time to fetch the first starship that could fit the container(Ci) using segment trees. For n containers, nlog(n) should be the time taken for the solution in total. Im getting a nzec though. I have run some tests on my own and it seems to work fine. I have submitted my solution in java, any ideas what the issue could be?