Anybody knows what in this test?
I've optimized my algorithm after first time limit and now it runs really very fast; on my example file with 100 trains, 100 stations and 100 friends it takes only 145 milliseconds to calculate the answer - even in debug build.
I just cannot imagine why it could calculate answer on some test for more than 2 seconds...
UPD: 129ms in release build...

Edited by author 12.10.2008 04:15

btw, i have changed DFS to BFS in my code (i had to define abstract tasks processor and implement stack and queue processor), and, although on my large tests it takes equal time independent of the engine used (stack or queue), stack engine have failed one more time on test #16 and queue engine have passed it.