OJ Board

Thank you Martin, I think I understand the idea now

Hi,
I was thinking quite a long time how to solve this, but still no results :-?. Can anyone help me with this problem? A small hint would be appreciated 8) . (I thought about finding a reasonable solution first (shortest paths etc.) and then backtracking perhaps?, but this seems to be way too slow ...

Big thx Tomal for your hint. My solution uses 2 Dijkstras after Floyd (one for fastest routes and one for cheapest). It's not as fast as yours but IT WORKS !!

Can you give me a hint how to solve this problem? Is it Dijkstra alg. modification, or sth like that?