Christmas Tree

Правка en2, от rahul_1234, 2017-05-28 23:11:04

I had a doubt how this solution clears large dataset of Kickstart Round B as it is (N*M*K) which is dp entries and each entry is approx (N*M). Lastly T test cases too and each of the variable, that is, N, M, K, T is in range 1,..,100.

Link of solution

Link Of Problem

Am I making an error in understanding or test cases were weak as I tried locally on large dataset and it worked within 2 mins.

Теги kickstart, #dp, round b, algorithm complexity

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский rahul_1234 2017-05-29 12:20:06 29 Tiny change: ' 2 mins.\n\nPlease if someone can help.' -> ' 2 mins.\n'
en4 Английский rahul_1234 2017-05-29 12:19:12 31 Tiny change: 'in 2 mins.' -> 'in 2 mins.\n\nPlease if someone can help.'
en3 Английский rahul_1234 2017-05-28 23:13:02 12 Tiny change: ' entry is approx (N' -> ' entry is computed in approx (N'
en2 Английский rahul_1234 2017-05-28 23:11:04 14
en1 Английский rahul_1234 2017-05-28 23:10:46 536 Initial revision (published)