QUEEN  Wandering Queen
There is a checkmates board with n rows and m columns. Some of the cells of the board are occupied. There is a queen standing on a certain cell. It wants to move to another cell of this board. Help it do this making the least possible moves. The queen can go any number of cells in any of eight directions in a single move, but it can't pass through or stand on the occupied cells and leave the board.
Input
The first line of the input contains number t – the amount of tests. Then t test descriptions follow. The first line of each test consists of two numbers n and m separated with a space. Then n lines follow each containing m characters describing the board. Character ‘.’ means a free cell, character ‘X’ – an occupied cell, character ‘S’ – the starting cell of the queen, character ‘F’ – the cell where the queen wants to go. It is guaranteed that there will be exactly one character ‘S’ and one character ‘F’ on each board.
Constraints
1 <= t <= 30
2 <= n, m <= 1000
Output
For each test case print the minimum number of moves the queen has to do to reach the desired cell. Print ‘1’ if the queen can’t reach the cell.
Example
Input: 3 3 3 S.. ... ..F 3 3 S.. XX. F.. 3 3 S.. XXX ..F Output: 1 3 1
hide comments
karan173:
20140427 22:37:24
nice problem! 

zingoba:
20131225 13:21:43
The time limit is too strict for non C/C++ languages. Hate to be 'forced' to write in C++. 

avinash kumar:
20130714 20:49:38
I tried dfs, it gave runtime error,


Rishav Goyal:
20130622 12:31:24
8*n*m


Jakub ©afin:
20121026 20:24:12
Spooky: are you sure you're fine with <0.5 seconds per large test case? On SPOJ's not exactly hiend machines? 

Mukesh Yadav:
20120907 17:41:21
@[Trichromatic] XilinX


Hemant Verma:
20110728 21:33:11
Hint : Use another data structure to store direction in which you have traversed the given point Last edit: 20110728 21:33:23 

Spooky:
20090418 13:00:03
well... I'd say you should get rid of the second 8... 

[Trichromatic] XilinX:
20090418 12:25:38
Mmm. Several TLEs. Now my solution has time complexity O(8*8*n*m). Could someone tell me the algorithm with which complexity will work?


[Trichromatic] XilinX:
20090418 08:21:24
Thanks for pointing that out! 
Added by:  Spooky 
Date:  20090416 
Time limit:  0.703s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Advancement Spring 2009, http://sevolymp.uuuq.com/ 