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':

ABC

One such path is:

path

Input

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.

Output

For each test case print “Case C: X” without quotes where C is the case number starting with 1 and X is the solution.

Example

Sample Input:
4 3
ABE
CFG
BDH
ABC
0 0

Sample Output:
Case 1: 4

Added by:Ali Arous
Date:2011-11-05
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:FCIS Local Contest 2012

hide comments
2016-01-31 18:19:23 KUNDAN KUMAR
Can anybody list these four paths , how the output is coming four.

2016-01-24 08:28:53
DFS -> 0.01 :)
2015-12-31 12:03:53 BRAIN
Case_1:_4 <- wrong output
Case 1: 4 <- true output
It gives me 5 wrong answer :((((((( bad day
2015-12-26 16:39:42 sunil
finally ac: using DP
2015-12-20 11:02:33
prog.cpp:1:1: error: expected unqualified-id before '<' token

i am getting this error again and again although my code works fine on ideone .
please help.

Last edit: 2015-12-20 11:19:28
2015-12-18 06:38:14 Aditya Kumar
really nice question--- Implemented BFS.
@dhruv_iitj: - AABCD the answer is 4 [ABCD]
for ABBCD it is 2 [AB].

It is self- explanatory in the question.
2015-12-14 06:23:48
can the answer be AABCD... that is, can we have redundancy of letters??
2015-12-03 12:25:15 Prateek Agarwal
had to use memoization to get AC.
2015-11-24 23:04:38 arjun
getting tle using dfs...any suggestions
2015-11-24 21:54:43 arjun
getting wa..cant think of any oter corner cases...need help..thanks


Last edit: 2015-11-24 21:55:55
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.