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
be careful about output format..
i had 2 TLE too ... i will use visited path arrray
Consider the tst cases
Good problem.Using dfs .... Graph is happiness...Last edit: 2015-04-07 15:52:21
My 200th :D
how wasi added an image.....anyone please tell.
is there any space between any two lines?
Sometimes the difference between TLE and AC is just an ampersand
@Hasil Sharma initial image
Initial image is missing ... Can anyone please provide the link ?
|Added by:||Ali Arous|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM64|
|Resource:||FCIS Local Contest 2012|