BEAUSUB - Editorial

kim_123 · July 29, 2021, 5:04pm

why did my O(n*k) is giving tle ?
Anyone Help
https://www.codechef.com/viewsolution/49197825

hunt_rrr · July 29, 2021, 5:19pm

when we will have a video editorial for this problem?

iamits26ap · July 30, 2021, 11:53am

Is this not giving TLE as the complexity is more than O(NK)??

shaky_adino · July 30, 2021, 12:07pm

It does give TLE, but that reply was for @chandan_125 who wanted to know the code for brute force approach

md_aman · July 31, 2021, 5:00am

Sir, please recursive solution and memoization ??

shivanshj · July 31, 2021, 5:07pm

Hmm… I don’t know about any such chart, but as far I know (from problems I have solved/discussed with my friends), ~1e6 operations means O(NlogN) sol… ~1e7 operations means at most O(N) sol…~5e3 means O(N^2)…~20 means O(2^n) or O(n2^n) …usually involves bitmask dp. (Note these are just approximate figures)

akash_ba · July 31, 2021, 5:39pm

Can anybody tell me why my solution is not working?
Ignore the last comment code
Approach: Top-Down DP
Link: CodeChef: Practical coding for everyone

hritulagrawal · August 1, 2021, 2:24am

Thankyou. It’s helpful.

code_roaster · August 1, 2021, 8:23am

Online Judge.

coder0687 · August 7, 2021, 9:21am

Excatly same thing I was doing , Plz let me know where I am wrong.

Code Link:

anon70699125 · August 21, 2021, 1:02pm

Great problem and great solution. Lots of things to learn from this.
Thanks !