lazy_wallflower's blog

By lazy_wallflower, 3 months ago, In English

I'm stuck on MLE at a 3 month old problem, I feel I should complete that, Please take a look and help me out 1981C - Turtle and an Incomplete Sequence My code : 264590950 PS: My code is a bit complex, but my idea is very similar to the one given in the editorial of this contest, by traversing, x/2 2x and 2x+1, until I reach my required value, also adhering to constraints

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

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

can step number be equal to n? i mean n==step

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

You should write the map outside your bfs function because the memory global will be larger than the inside of a function (and also in your function there are too many activity with your map) it may leads to MLE