first I tried this problem with 1-0 bfs, but it was giving me wa5. when I coded it int dijkstra with edges of 0,1,2,3, I got AC. so is minimal k necessary?