How to solve Problem E Carrot for rabbits with k<=1e18 . Original version is very good but curious to know the solution for larger contraints.

Can someone figure out why this code doesnt work

I have used a simple 2-d DP where upto index i :

1. DP[i].a = the numer of subsequences 'a'

2. DP[i].ab = the numer of subsequences 'ab'

3. DP[i].abc = the numer of subsequences 'abc'

when s[i]= a,b or c update them normally and when s[i]='?' , i consider all 3 cases one by one

Where am I wrong? does anyone solve it using 2-D DP instead of 3-D ? is 3-D even necessary here?

Almost Sorted is the coolest sorting problem I've ever seen, nice explanation

can someone help for solving E using centroid decomposition?

they should have mentioned it properly, got 2 penalties and a lot of time wasted

what is the meaning of sequence in question C ? is this a sequence [ 1,3,5] or its need to be contigeous ?

Changed my handle , red colored 3 looks awesome , hope it'll be real one day , starting the journey from this contest

I am Getting MLE on TC-53
Can someone review my code and figure out the issue ,Thanks

• Problem
• My code

I am in search of some topics/DS/Algo that shuld be particularly grinded upon to become CM(or even more) . Can someone provide a list or something
PS : I Just studied HLD, Centroid Decomposition , Mo's (without updates)

Thanks , After struggling with other hashing and tougher dp recurrences , This solution made the task very easy