1996 Canadian Computing Competition, Stage 2
Day 2, Problem 1: Where's Waldorf?
Given an m by n grid of letters and a list of words, find the location in the grid at which the word can be found. A word matches a straight, uninterrupted line of letters in the grid, regardless of case. The matching can be done in any of the eight directions either horizontally, vertically or diagonally through the grid.
The input begins with a number on a line by itself, indicating the number of test cases that follow.
Each test case consists of a pair of integers, m followed by n (1 ≤ m ≤ 50 and 1 ≤ n ≤ 50) in decimal notation on a single line.
The next m lines contain n letters each; this is the grid of letters in which the words of the list must be found. The letters in the grid are in upper or lower case.
Following the grid of letters, another integer k appears on a line by itself (1 ≤ k ≤ 20).
The next k lines of input contain the list of words to search for, one word per line. These words contain upper and lower case letters only (no spaces, hyphens or other non-alphabetic characters). All words have positive length.
For each word in the word list of one test case, your program must output a pair of integers representing the location of the corresponding word in the grid. The integers must be separated by a single space.
The first integer is the line in the grid where the first letter of the given word can be found (1 represents the topmost line in the grid, and m represents the bottommost line).
The second integer is the column in the grid where the first letter of the given word can be found (1 represents the leftmost column in the grid, and n represents the rightmost column in the grid).
If a word can be found more than once in the grid, then the location which is output should correspond to the uppermost occurrence of the first letter of the word (i.e. the occurrence which places the first letter of the word closest to the top of the grid). If two or more words are uppermost, the output should correspond to the leftmost of these occurrences. All words can be found at least once in the grid. Outputs of different test cases are separated by a blank line.
2 2 2 by re 2 be eb 8 11 abcDEFGhigg hEbkWalDork FtyAwaldORm FtsimrLqsrc byoArBeDeyv Klcbqwikomk strEBGadhrb yUiqlxcnBjf 4 Waldorf Bambi Betty Dagbert
1 1 2 2 2 5 2 3 1 2 7 8
Point Value: 10
Time Limit: 2.00s
Memory Limit: 16M
Added: Jun 25, 2013
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3