Really good explanation! Could anyone tell me why the time complexity is O(n*m *2^n) though? I understood that m* 2^n comes from the estate configuration, but isn't the transition also 2^n since the recursive fill_column function can branch out?
Do you really think that i would fake getting an ac???!!! The point of these editorials is to enpower you to come up with your own working solution. Show me your submission to point out where you went wrong
![[CSES][Dynamic Programming] Elevator rides](http://i.ytimg.com/vi/UEkvzjsodDk/mqdefault.jpg)
![[CSES][Dynamic Programming] Elevator rides](/img/tr.png)
![[CSES][Dynamic Programming] Projects](http://i.ytimg.com/vi/lFqFm_Z9kGI/mqdefault.jpg)
![[CSES][Mathematics] Bracket Sequences I](/img/n.gif)
your effort was amazing thanks
Thank you for the explanation.
what is your codeforces ?
Really good explanation! Could anyone tell me why the time complexity is O(n*m *2^n) though? I understood that m* 2^n comes from the estate configuration, but isn't the transition also 2^n since the recursive fill_column function can branch out?
this one is tough
Indeed, that's why i thought the visualisation was necessary.
The explaination is great, but when I copied your code and it doesn't seem to work. I wonder if you could share the link of your working code? Thanks.
Do you really think that i would fake getting an ac???!!! The point of these editorials is to enpower you to come up with your own working solution. Show me your submission to point out where you went wrong