Search found 2 matches

by extremegf
Sun Nov 22, 2015 3:49 pm
Forum: Volume 5 (500-599)
Topic: 589 - Pushing Boxes
Replies: 14
Views: 5541

Re: 589 - Pushing Boxes

Ok, I've decided to go one step forward with this. These cases demonstrate my point: 15 18 ################## ################## ################## ################## ################## ################## T################# .##########...#### .......####.#.#### ..##.#.####.#.#### .###...####.#.#### ...
by extremegf
Sun Nov 22, 2015 2:59 pm
Forum: Volume 5 (500-599)
Topic: 589 - Pushing Boxes
Replies: 14
Views: 5541

Re: 589 - Pushing Boxes

The test set for this task is still invalid. I just got an AC with a two BFS solution, which isn't correct. I claim that no two BFS algorithm can solve this problem and it actually requires a full shortest paths algorithm like dijkstra. Consider following 2 graphs: S - source node T - destination no...

Go to advanced search