Any hints? thanks...
my approach is to use bfs

Edited by author 14.01.2013 05:59

I’m using dijkstra algorithm. I have WA 11 too.
I see you managed to pass this test.
Could you tell me please, what is the test 11?
I don’t think this problem can be solved by BFS, is it?
Thanks,

This post gives u some idea.

http://rot47.net/_acm/viewtopic.php?f=3&t=2

Edited by author 26.01.2013 15:38

Thank you very much,

I'll learn and implement those hints as soon as I finish Facebook Hacker Cup 2013 problems,
Hopefully I can get AC.

good luck for it...

apparently it is now too late for me to join..

Thanks,

Yes, it is late now, but next year if you register once, you can participate every year.
And in April there will be Google Code Jam 2013, you can participate in that contest.

I solved this by using BFS. But everytime I adds into queue all not used vertices, reachable from the current vertex along ribs of one and the same direction.

You are wrong, I wrote simple bfs and its got ac with the second attempt:)

Could you give any hint to bfs?