UVA 10010 Where's Waldorf?
来源:互联网 发布:新页进销存软件客服 编辑:程序博客网 时间:2024/04/27 19:53
Where's Waldorf?
Given a 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. A word can match the letters in the grid regardless of case (i.e. upper and lower case letters are to be treated as the same). The matching can be done in any of the eight directions either horizontally, vertically or diagonally through the grid.Input
The input begins with a single positive integer on a line by itself indicating the number of the cases following, each of them as described below. This line is followed by a blank line, and there is also a blank line between two consecutive inputs.The input begins with a pair of integers, m followed by n, in decimal notation on a single line. The next m lines contain nletters each; this is the grid of letters in which the words of the list must be found. The letters in the grid may be in upper or lower case. Following the grid of letters, another integer k appears on a line by itself ( ). The next k lines of input contain the list of words to search for, one word per line. These words may contain upper and lower case letters only (no spaces, hyphens or other non-alphabetic characters).
Output
For each test case, the output must follow the description below. The outputs of two consecutive cases will be separated by a blank line.For each word in the word list, a pair of integers representing the location of the corresponding word in the grid must be output. 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 occurence of the word (i.e. the occurence 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 occurences. All words can be found at least once in the grid.
Sample Input
18 11abcDEFGhigghEbkWalDorkFtyAwaldORmFtsimrLqsrcbyoArBeDeyvKlcbqwikomkstrEBGadhrbyUiqlxcnBjf4WaldorfBambiBettyDagbert
Sample Output
2 52 31 27 8
直接暴力8个方向去找。。
注意大小写全转换为小写。
#include <iostream>using namespace std;#include <stdio.h>#include <string.h>#include <ctype.h>#include <stdlib.h>int d[8][2] = {{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1}, {1, -1}, {1, 0}, {1, 1}};int t;int tt;int n, m;int len;char sbb[105];char sb[105][105];int dfs(int x, int y){ for (int i = 0; i < 8; i ++) {int xx = x; int yy = y;int j;for (j = 0; j < len; j ++){ if (sb[xx][yy] == sbb[j] && xx >= 0 && xx < n && yy >= 0 && yy < m) {xx += d[i][0];yy += d[i][1]; } else {break; }}if (j == len) return 1; } return 0;}int main(){ scanf("%d", &t); while (t --) {scanf("%d%d", &n, &m);getchar();for (int i = 0; i < n; i ++){ for (int j = 0; j < m; j ++) {cin >> sb[i][j]; sb[i][j] = tolower(sb[i][j]); }}scanf("%d", &tt);getchar();while (tt --){ int ju = 0; gets(sbb); len = strlen(sbb); for (int i = 0; i < len; i ++)sbb[i] = tolower(sbb[i]); for (int i = 0; i < n; i++) {for (int j = 0; j < m; j ++){ if (dfs(i, j)) {printf("%d %d\n", i + 1, j + 1);ju = 1;break; }}if (ju) break; }}if(t) printf("\n"); } return 0;}
- UVa 10010 - Where's Waldorf?
- uva 10010 Where's Waldorf?
- UVa 10010 - Where's Waldorf?
- UVa 10010 - Where's Waldorf?
- uva-10010 - Where's Waldorf?
- UVA 10010 - Where's Waldorf?
- UVa 10010 - Where's Waldorf?
- UVa 10010 - Where's Waldorf?
- UVA 10010 Where's Waldorf?
- UVa 10010: Where's Waldorf?
- UVA 10010 Where's Waldorf?
- UVa - 10010 - Where's Waldorf?
- UVA 10010 Where's Waldorf?
- uva 10010 - Where's Waldorf?
- uva 10010 Where's Waldorf?
- uva - 10010 - Where's Waldorf?
- UVa 10010 - Where's Waldorf?
- UVA - 10010 - Where's Waldorf
- coding - 关于括号匹配的问题
- C#文件批量改名
- 在linux下将OpenGL超级宝典里的例子用eclipse打开
- JAVA JDK之配置环境变量
- HM简单介绍
- UVA 10010 Where's Waldorf?
- MFC can't find the defintion of this function解决方法
- 栈和堆的区别
- 在AutoCAD中使用Python——Through the Interface
- grep、egrep、fgrep命令
- MATLAB中求非方阵的广义逆矩阵
- Java中abstract和interface的区别
- UVA 10361 Automatic Poetry
- 优化数据库的10个建议