Please Help me, i get WA #11 many times.
My solution in Java
1) For each "phone number" get list neighbours
2) use PriorityQueue to find shortest path
3) print path
For calculations with "phone number" use Long
for init max_time use 10^12
I can send my solution on mail.
Sorry for my english.

You can send it to atush_1988@mail.ru
I've got ac in java

Got the same problem using c++(((
Help sombody, please!