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
Shubham:
2015-06-11 20:19:00
Easy one...silly mistake costed me WA...just use DFS nd optimize it !!!!! |
|
Shubham Bansal:
2015-05-26 21:41:24
be careful about output format.. |
|
maala_m:
2015-05-22 18:01:55
i had 2 TLE too ... i will use visited path arrray
|
|
Ayon Das:
2015-05-12 14:43:39
Consider the tst cases
|
|
GAURAV CHANDEL:
2015-04-07 15:52:04
Good problem.Using dfs .... Graph is happiness... Last edit: 2015-04-07 15:52:21 |
|
Anubhav Gupta:
2015-03-19 20:12:25
My 200th :D |
|
Rajat (1307086):
2015-02-18 23:34:17
how wasi added an image.....anyone please tell.
|
|
vedsar:
2015-02-08 07:41:57
is there any space between any two lines?
|
|
Ankit Sultana:
2015-01-02 18:44:23
Sometimes the difference between TLE and AC is just an ampersand |
|
ওয়াসী (Wasi):
2014-01-16 11:03:37
@Hasil Sharma initial image
|
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 |