Damn , it was fun last time with kalash coming in at last moment and grabbing all the prizes

Will the winner get to meet DJ sanghvi??? 😍😍😍😍

Auto comment: topic has been updated by dedsec_29 (previous revision, new revision, compare).

is it rated ? @dedsec_29[user:dedsec_29] does it will have any affect on rating of CodeChef.

rr sir orz ✨
also dedsec saar orz ✨, sayan sir orz ✨.

Auto comment: topic has been updated by dedsec_29 (previous revision, new revision, compare).

As a tester, I enjoyed testing the problems! Everyone has done their best to prepare an enjoyable contest. Therefore, I look forward to your participation!

It was great participating last year. Hope this year turns out to be fun as well !!

As a tester of this contest, I liked the problems and encourage everyone to participate in it. Best of luck folks!

Problem Link: Alice and Bob Cheat

My Approach: Considered the string and the array in reverse order. Calculate the prefix function, pi where pi[i] is the length of the maximum proper prefix of the substring s[0...i] which is also suffix. Built sparse table on prefix sum of the given score array. For every positive value of pi, fixed the segment of length pi which ends at i. Then query for a maximum value in this segment and subtract the necessary part for getting the exact maximum prefix sum on this segment. Also get the maximum value of the segment starting at 0 of length pi[i]. Then ans is the maximum of this two value over all possible pi value. I was getting WA with this approach.
Can anyone help me finding out the fault of my approach?
TIA

Problem Tree Limit Exceeded my solution is giving TLE.

I have used the following :

• A vector of priority queue to store that height maxm height of tree for any ith planet
• A map of multiset , which store index of all planet for height h. This i require to get hold of planet from which tree of maximum height is removed
• A segment Tree to find maximum element in range [l,r].

First of all i have initialized the seg tree using the maxm element for all planet. Then if we want to remove tree with max height in range [l,r]. Then I find out maxm height using segment tree. Then use maxm height to know the index of the planet using map (ii). Erase that element from map. Erase top element of that priority then finally update the segment tree if required.

Can anyone help me to get rid of TLE. Please let me know if any of the step in my solution is redundant.

Thank you

Nice problem set, totally enjoyed this!!

Auto comment: topic has been updated by dedsec_29 (previous revision, new revision, compare).