Need help to find the time complexity!

Revision en1, by Theo830, 2020-07-22 19:09:38

Today when I was looking at the submissions in problem 1381B - Unmerge I saw 300iq's and Benq's solution. Both submissions(87538626 , 87530540) has a for loop and it does some operations with a bitset in order to find if you can make the sum of some sizes of blocks equal to n. I have done the same solution however I use simple $dp[i][j]$ = if we can make the sum $j$ using only the first $i$ elements. I was wondering what is the time complexity of their dp. Any ideas?

#### History

Revisions

Rev. Lang. By When Δ Comment
en1 Theo830 2020-07-22 19:09:38 686 Initial revision (published)