Word-Search Wonder
The Pyrates Restaurant was starting to fill up as Valentine McKee walked in. She scanned the crowd for her sister, brother-in-law, and nephew. Seeing her sister waving from the far end of the restaurant, she made her way back to their booth. ``Hi, Valentine,'' her sister and brother-in-law, Niki and Dennis Chapman, greeted her.| Word-Search Wonder |
``Hi, guys,'' she replied. ``What are you doing, Wade?'' she asked her nephew. He was busy working on one of the restaurant's activity sheets with a crayon.
``I'm doing a word search game,'' Wade explained. ``I have to find all of these words in this big mess of letters. This is really hard.'' Wade looked intently at the paper in front of him.
``Can I help?'' asked Valentine, looking across the table at the activity sheet.
``Sure. These are the words we're looking for. They're the names of different kinds of Planes, Trains, and Automobiles.''
Input
The first line of input will specify the length (in characters) of the sides of the letter matrix (the matrix of letters will be square). The length, l, will be in the range
. The next l lines of input will be the matrix itself, each line will contain l uppercase letters.A list of words will follow. Each word will be on a line by itself; there will be 100 or fewer words. Each word will be 100 or fewer characters long, and will only contain uppercase letters.
The final line of input will contain a single zero character.
Output
Your program should attempt to find each word from the word list in the puzzle. A word is ``found'' if all the characters in the word can be traced in a single (unidirectional) horizontal, vertical, or diagonal line in the letter matrix. Words may not ``wrap around'' rows or columns, but horizontal and diagonal words may proceed from right to left (``backwards''). For each word that is found, your program should print the coordinates of its first and last letters in the matrix on a single line, separated by a single space. Coordinates are pairs of comma-separated integers (indexed from 1), where the first integer specifies the row number and the second integer specifies the column number.If a word is not found, the string ``Not found'' should be output instead of a pair of coordinates.
Each word from the input can be ``found'' at most once in the puzzle.
Sample Input
5 EDEEE DISKE ESEEE ECEEE EEEEE DISC DISK DISP 0
Sample Output
1,2 4,2 2,1 2,4 Not found
DFS
#include<stdio.h>
#include<cstring>
#include<string>
#include<vector>
#define REP(i, b, n) for (int i = b; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define DBG 0
using namespace std;
int cases=1,L,D;
vector<int>seq;
string T;
int comp[8][2],next[8],res[8],SR,SC,ER,EC;
vector<string>query;
char maz[110][110],dir[8][2];
vector<pair<int,int> >loc[26];
void init(){
dir[0][0]=-1,dir[1][1]=-1,dir[2][0]=1,dir[3][1]=1,
dir[4][0]=-1,dir[4][1]=-1,dir[5][0]=1,dir[5][1]=-1,
dir[6][0]=1,dir[6][1]=1,dir[7][0]=-1,dir[7][1]=1;
}
void getA(){
rep(i,L)rep(j,L)loc[maz[i][j]-'A'].push_back(make_pair(i,j));
}
bool isValid(int a,int b){return a>=0&&a<L&&b>=0&b<L;}
bool DFS(int r,int c,int len){
int a,b;
if(len==T.size()){ER=r,EC=c;return 1;}
else{
a=r+dir[D][0],b=c+dir[D][1];
if(isValid(a,b)&&maz[a][b]==T[len])
if(DFS(a,b,len+1))return 1;
return 0;
}
}
void ans(){
bool ok;
getA();
rep(i,query.size()){
ok=0;
rep(j,loc[query[i][0]-'A'].size()){
SR=loc[query[i][0]-'A'][j].first,SC=loc[query[i][0]-'A'][j].second;
if(DBG)printf("query %s: %d %d\n",query[i].c_str(),SR,SC);
rep(k,8){D=k,T=query[i];
if(DFS(SR,SC,1)){printf("%d,%d %d,%d\n",SR+1,SC+1,ER+1,EC+1),ok=1;break;}
}
}
if(!ok)printf("Not found\n");
}
}
int main(){
char chs[110];
scanf("%d",&L);
init();
rep(i,L)scanf("%s",maz[i]);
while(scanf("%s",chs)==1){
if(chs[0]=='0')break;
else query.push_back(chs);
}
ans();
}
b
, the circumflex. The character (or in one case, the two characters) immediately following the control sequence introducer will direct your software in performing its special functions. Here is the complete list of control sequences you will need to interpret:
of zeros and ones. Zero represents white squares and one represents black squares. Some squares of the crossword are numbered and assigned to these numbers are the descriptions of the words that should be written either ``across'' or ``down'' into the crossword. A square is numbered if it is a white square and either (a) the square below it is white and there is no white square immediately above, or (b) there is no white square immediately to its left and the square to its right is white. The squares are numbered from left to right, from the top line to the bottom line.
characters. Black square and white squares (numbered and not numbered square) are represented as follows (where nnn is the number of the square):
15 board. Each square contains a ball colored red (R), green (G), or blue (B). Two balls belong to the same cluster if they have the same color, and one can be reached from another by following balls of the same color in the four directions up, down, left, and right. At each step of the game, the player chooses a ball whose cluster has at least two balls and removes all balls in the cluster from the board. Then, the board is ``compressed'' in two steps: