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
madhavgaba:
2016-10-06 20:43:30
BFS:D |
|
hamjosh1:
2016-09-10 22:19:32
Got 5 Wa because of wrongly taking the string input .-. |
|
true_coder:
2016-09-05 14:16:00
note that max length of path is 26 ...stupid mistake...i was counting in cyclic manner from a->z->a |
|
realrefo31:
2016-09-05 12:01:33
BEAST |
|
geekhamza:
2016-08-22 08:04:53
take care of visiting a point two time, start dfs when you find 'A' and be carfull about inbound function , it caused me 3 WA |
|
yashwanth_58:
2016-08-13 16:17:09
Getting TLE even in DFS !!
|
|
siddharth_0196:
2016-08-02 15:56:18
AC in 0.00s (BFS) ! :D
|
|
manhterry93:
2016-07-24 18:13:28
LOL Start at 'A'..... |
|
visvats_141095:
2016-06-19 15:05:48
first question where i did dfs in a matrix :D
|
|
citransvostok:
2016-06-09 19:50:52
simple recursion ACC 0.00 |
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 |