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:
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
hide comments
sathya_dev:
2015-11-23 14:53:47
For those getting WA. A Path has to start from 'A' and sequence of consecutive letters (not just any sequence of consecutive letters.
|
|
varun yadav:
2015-11-05 09:48:00
finally accepted :p |
|
Himanshu Bansal:
2015-10-31 14:53:00
nice question |
|
dev:
2015-10-19 13:26:48
FIRST dfs prob !! Ac :) |
|
topke:
2015-10-08 10:29:54
This is easy i don't know why it has 20% success rate :D |
|
Shashank Tiwari:
2015-09-29 04:39:08
Well , instead of saying DFS , i will say recursion with memoization |
|
shayan718:
2015-09-15 11:37:25
mr salimi what r u doing ?
|
|
Harsh Vardhan Ladha:
2015-09-08 19:49:44
Consider the case when matrix do not have character A
|
|
Steven Hans Limantoro:
2015-07-16 18:35:27
Multisource BFS is your friend (y) Last edit: 2015-07-16 18:40:19 |
|
SangKuan:
2015-07-07 12:00:14
One TLE, One WA.first use bfs...then output error.haha |
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 |