suraj021's blog

By suraj021, history, 5 years ago, In English,

I was solving problem Metro in TimusOJ using DP but it get TLE verdict.How do i optimize my solution. My Solution in Ideone . Thanks Sorry for wrong link. UPD: Accepted, Thank you codeforces community :)

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

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

Update the link of IdeOne, it was directing to Timus.

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

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

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

Try to use normal 2D array instead of this map< pair< int, int >, int > shit

»
5 years ago, # |
Rev. 5   Vote: I like it 0 Vote: I do not like it

First of all no need to use map when matrix can be around 1000*1000. And the main problem is that you are using m({i,j}) > 0 instead of m.find({i,j}) != m.end(). This is causing the TLE. Before using stl, try to read its tutorial first. And ceil() will always give upper bound, try to use something like (ans + 0.5) or round() and print as integer.