MdoingIt's blog

Getting TLE for O(n*k) solution. Can someone help!
By MdoingIt, history, 4 months ago, In English

Question — https://mirror.codeforces.com/problemset/problem/161/D

Submission — https://mirror.codeforces.com/contest/161/submission/278555376

IMO, it should pass the time constraints. Am I missing something?

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
4 months ago, # |
  Vote: I like it 0 Vote: I do not like it

try to use int array. not long vector

→ Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Buddy when you are calling dfs it's complexity is n*k*k... It should be n*k fir sol to work . Why are checking for all k values you only have to check for single k... Dp here is unnecessary

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Sorry, there are many mistakes in my above answer. Misread the problem statement. I will try to answer in some time. Please ignore above statement.

    → Reply