There is definitely bug in checker. My correct solution gets WA #12, some other solutions with loops get WA #12, and got AC after deleting it (but my solution guarantees there is no loops). I think, we should wait while somebody will deign to fix this bug in checker.
But such problems arise only with test #12. If you have WA #10, may be there is problem with your code...

From your words I can conclude what though your solution doesn't output any loops, It has some other bugs :) Leave you mail, may be I can help you.

VedernikoffSM[at]mail[dot]ru

How did you understand specifics of test 10?
Help, please.

I had problems with WA#9 and WA#10 due to bugs in my code, nothing conceptual. My solution considers loops, but the way it selects path for the answer, it will never attempt to backtrace a loopy one.

Edited by author 13.07.2008 23:58

If you have WA 10: "roads are unidirectional" means that roads are one-way ))

I also have WA12, I have submitted code which should produce a runtime error if there is a loop and it just WAd. Could anybody give me any clue?

Accepted.
If anybody's interested, my mistake was stopping the Dijkstra when it came across an already found node. It could be that distance to T is even more but still acceptable.

Edited by author 24.07.2008 16:29