How to approach the problem InterLeave Blocks from ZCO 2020
Hint till the editorial is out : DP[A][B][K]. dp[a][b][k] represents the number of ways we can interleave first a and b terms of array A and B respectively to form exactly k blocks of equal numbers, and the last term in the interleaved subsequence is from array A (from array B if the last value is 1 instead of 0)
Look at this problem which is quite similar.
On mobile rn so cant give a detailed explanation
Such hint, much wow!
At least describe your DP states, base case and recurrence relation !
EDIT: Nice, your edited answer is much better
Itna pr0 kaise
I used DP[A][B][K]
THANK YOU XDDDDDDDDDD. I AM DEAD SOMEONE HELP ME XDXD.
Best laugh since a few recent months XDDDD
Hahaha upload again I don’t mind
He is not editorialist LOL.
This meme is for editorialist
spam spam spam
somebody lock it(wait the mod is also involved in the spam )now who will lock it??
When codechef has meme wars : “Codechef is filled with spam. Codeforces has so much of informative talks”
When codeforces has meme wars : “This is so much fun. Coders are awesome memeists”
it was intended to be a joke
this is so true
The effort on memes is legit
I will. 1-2 memes are fine. But a meme war is definitely injustice to this post. @ashish_arora please make a new post if you still need help. Sorry for the inconvenience