BanazadehAria's blog

Strange Problem!
By BanazadehAria, history, 5 years ago, In English

Hi, I have written a simple dp solution for this problem ==> https://mirror.codeforces.com/contest/383/problem/D.

But its something strange that it gets accepted without memory optimizes ==> https://mirror.codeforces.com/contest/383/submission/68460051

and it doesnt get accepted with memory optimize ( Every state gets update only from before (i-1) So we can only have 2 rows). https://mirror.codeforces.com/contest/383/submission/68460038

The only thing that different is in these two solutions is simple memory optimizing.

UPD: solved

  • Vote: I like it
  • -8
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Firstly u still have dp array with size 1001 * 20005 (ur optimization in ur code is useless).
Secondly, if u just need to clear ur array before using it (u have the rubbish in ur array when using it)
I submit ur code just adding two lines, check https://mirror.codeforces.com/contest/383/submission/68626410

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by BanazadehAria (previous revision, new revision, compare).

→ Reply