OJ Board

After a quick overview i found a bug to your problem. you take the input N and R and instead of taking R roads you are taking N roads of information.

However if you correct this i think you will get tle.......
In the warshall() function u used a loop
for( double x = 0.00; x <= v[z][l]; x += eps ) where your eps is 1e-6
this will lead to tle......

thanks a lot bm_anas...i made a stupid error as well as reduced the eps to 1e-2 and AC!!!! thanks once again...

asif_iut wrote:thanks a lot bm_anas...i made a stupid error as well as reduced the eps to 1e-2 and AC!!!! thanks once again...

oops, this is not the intended way to solve this problem. The test cases are not strong enough but I admit that I have no idea how to generate good ones. Any one has some ideas?

oops, this is not the intended way to solve this problem. The test cases are not strong enough but I admit that I have no idea how to generate good ones. Any one has some ideas?

what should have been the idea for solving this problem??

asif_iut wrote:what should have been the idea for solving this problem??

you may take a look at this: http://en.wikipedia.org/wiki/Ternary_search

I solved this problem using Dijkstra and Differentiation.....