OJ Board

You should test whether your graph code can store all edges. That was my mistake and now i got accepted.

me too! I tried every tricky input i could think of. Including k=0, non stopping elevators, taking elevators up- and downward, ... I'm using a modified dijkstra to add the time when changing elevators. And my program is correct for all example input and previously posted examples in this board. Mich...