Hello can anyone tell me what is wrong with my code CodeChef: Practical coding for everyone
The logic i used is sort r and find each character of s in using binary search and erase those characters. if not found impossible else insert s in r just where s[0]>r[i]. It would be helpful if anyone could point out the flaw. Thank you!
Thanks for looking into it but I saw some successful solutions using sorting so AFAIK tle(I dont end up having tle) is not a problem and to get the lexicographically small i place s in the most favourable position.
Can you give me the right answer to the cases you prescribed?
Consider this testcase:
ddfg
becacbadddfg
Your output: aabbccddfgde
Correct output: aabbccdddfge
Key point: Between aaba and aaab. second one is lexically small.
And I have used your code and made some changes but I still got TLE for last test case, so sorting would definitely get TLE.
You can go through my solution : https://www.codechef.com/viewsolution/26857882
1 Like
Thank you bro! understood.
1 Like