|
|
back to boardI'm getting WA on TEST 2 can anybody give a test plz???! Posted by kerpoo 15 Aug 2015 22:01 used dijkstra and update the probability (distance in normal dijkstra) of node v for v like below:
dis[father[v]]=dis[father[v]] + edge(father[v],v).value - dis[father[v]]*edge(father[v],v).value
is there any problem?!
I'm not good enough in probability theory...
Edited by author 15.08.2015 22:01 Re: I'm getting WA on TEST 2 can anybody give a test plz???! Posted by S.Ged 15 Aug 2015 23:10 dijkstra doesn't do the job
the problem asks for the <<shortest path>> even if it isn't the minimum of all ( but of course it should be minimal among all shortest path) Re: I'm getting WA on TEST 2 can anybody give a test plz???! Posted by kerpoo 15 Aug 2015 23:35 tnx!
I wasn't so careful in reading the problem! |
|
|
