ABCPATH - ABC Path
You will be given a 2-dimensional grid of letters. Find the length of the longest path of consecutive letters, starting at 'A'. Paths can step from one letter in the grid to any adjacent letter (horizontally, vertically, or diagonally).
For example, in the following grid, there are several paths from 'A' to 'D', but none from 'A' to 'E':
One such path is:
Each test case will start with a line contains two integers H, W the height and width of the grid respectively 1 <= H, W <= 50. Then H lines follow each of W uppercase letters only. Input terminates with H = 0 and W = 0.
For each test case print “Case C: X” without quotes where C is the case number starting with 1 and X is the solution.
Sample Input: 4 3 ABE CFG BDH ABC 0 0 Sample Output: Case 1: 4
AC in one go
Last edit: 2019-02-04 13:33:11
Didn't use memo and got 2 TLEs. Then AC
DP on graphs.easily solvable in O(n*m) complexity.
Simple DFS, AC in one go! :)
BFS and DFS both work just fine! good problem to practice both
Nice question I started with recursion and optimized it to multisource bfs. Got a lot of TLEs in between
AC in one go !!
Simple DFS !! Just make once used characters unusable for further times as they can never help to reach farther than they did last time ;)
|Added by:||Ali Arous|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM64|
|Resource:||FCIS Local Contest 2012|